./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:59:33,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:59:33,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 18:59:33,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:59:33,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:59:34,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:59:34,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:59:34,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:59:34,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:59:34,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:59:34,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:59:34,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:59:34,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:59:34,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:59:34,035 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:59:34,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:59:34,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:59:34,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:59:34,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:59:34,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:59:34,036 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:59:34,038 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:59:34,039 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:59:34,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:59:34,039 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:59:34,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:59:34,040 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:59:34,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:59:34,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:59:34,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:59:34,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:59:34,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:59:34,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:59:34,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:59:34,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:59:34,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:59:34,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:59:34,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:59:34,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:59:34,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:59:34,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:59:34,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:59:34,043 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2024-11-22 18:59:34,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:59:34,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:59:34,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:59:34,284 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:59:34,284 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:59:34,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-11-22 18:59:35,646 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:59:35,846 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:59:35,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-11-22 18:59:35,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f713a9a/6dae413c7ed842e9b9986fc8ba74a186/FLAGcc927d24d [2024-11-22 18:59:35,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f713a9a/6dae413c7ed842e9b9986fc8ba74a186 [2024-11-22 18:59:35,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:59:35,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:59:35,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:59:35,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:59:35,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:59:35,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:59:35" (1/1) ... [2024-11-22 18:59:35,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@205ed9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:35, skipping insertion in model container [2024-11-22 18:59:35,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:59:35" (1/1) ... [2024-11-22 18:59:35,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:59:36,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:59:36,230 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:59:36,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:59:36,284 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:59:36,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36 WrapperNode [2024-11-22 18:59:36,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:59:36,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:59:36,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:59:36,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:59:36,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36" (1/1) ... [2024-11-22 18:59:36,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36" (1/1) ... [2024-11-22 18:59:36,333 INFO L138 Inliner]: procedures = 127, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2024-11-22 18:59:36,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:59:36,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:59:36,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:59:36,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:59:36,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36" (1/1) ... [2024-11-22 18:59:36,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36" (1/1) ... [2024-11-22 18:59:36,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36" (1/1) ... [2024-11-22 18:59:36,379 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 6, 16]. 67 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-11-22 18:59:36,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36" (1/1) ... [2024-11-22 18:59:36,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36" (1/1) ... [2024-11-22 18:59:36,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36" (1/1) ... [2024-11-22 18:59:36,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36" (1/1) ... [2024-11-22 18:59:36,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36" (1/1) ... [2024-11-22 18:59:36,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36" (1/1) ... [2024-11-22 18:59:36,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:59:36,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:59:36,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:59:36,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:59:36,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36" (1/1) ... [2024-11-22 18:59:36,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:59:36,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:36,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 18:59:36,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 18:59:36,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 18:59:36,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 18:59:36,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 18:59:36,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 18:59:36,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 18:59:36,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 18:59:36,495 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-22 18:59:36,495 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-22 18:59:36,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:59:36,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:59:36,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 18:59:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:59:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:59:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 18:59:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:59:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:59:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 18:59:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:59:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 18:59:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 18:59:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-22 18:59:36,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 18:59:36,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 18:59:36,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 18:59:36,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:59:36,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:59:36,633 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:59:36,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:59:36,914 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-22 18:59:36,914 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:59:36,930 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:59:36,931 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-22 18:59:36,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:59:36 BoogieIcfgContainer [2024-11-22 18:59:36,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:59:36,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:59:36,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:59:36,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:59:36,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:59:35" (1/3) ... [2024-11-22 18:59:36,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74203259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:59:36, skipping insertion in model container [2024-11-22 18:59:36,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:36" (2/3) ... [2024-11-22 18:59:36,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74203259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:59:36, skipping insertion in model container [2024-11-22 18:59:36,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:59:36" (3/3) ... [2024-11-22 18:59:36,937 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2024-11-22 18:59:36,949 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:59:36,950 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2024-11-22 18:59:36,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:59:36,999 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b5561fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:59:36,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-11-22 18:59:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 108 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:59:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:59:37,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:37,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:37,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:37,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1816241367, now seen corresponding path program 1 times [2024-11-22 18:59:37,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:37,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039295445] [2024-11-22 18:59:37,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:37,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:37,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:37,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039295445] [2024-11-22 18:59:37,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039295445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:37,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:37,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:59:37,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449537745] [2024-11-22 18:59:37,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:37,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:59:37,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:37,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:59:37,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:59:37,251 INFO L87 Difference]: Start difference. First operand has 112 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 108 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:59:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:37,401 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-11-22 18:59:37,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:59:37,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-22 18:59:37,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:37,419 INFO L225 Difference]: With dead ends: 108 [2024-11-22 18:59:37,420 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 18:59:37,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:59:37,450 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:37,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 174 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:59:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 18:59:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-22 18:59:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.896551724137931) internal successors, (110), 101 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:59:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2024-11-22 18:59:37,579 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 7 [2024-11-22 18:59:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:37,581 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2024-11-22 18:59:37,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:59:37,581 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2024-11-22 18:59:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:59:37,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:37,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:37,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:59:37,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:37,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:37,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1816241368, now seen corresponding path program 1 times [2024-11-22 18:59:37,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:37,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209364259] [2024-11-22 18:59:37,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:37,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:37,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:37,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209364259] [2024-11-22 18:59:37,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209364259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:37,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:37,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:59:37,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236219015] [2024-11-22 18:59:37,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:37,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:59:37,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:37,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:59:37,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:59:37,806 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:59:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:37,938 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2024-11-22 18:59:37,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:59:37,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-22 18:59:37,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:37,940 INFO L225 Difference]: With dead ends: 102 [2024-11-22 18:59:37,941 INFO L226 Difference]: Without dead ends: 102 [2024-11-22 18:59:37,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:59:37,942 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:37,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 173 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:59:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-22 18:59:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-22 18:59:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:59:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2024-11-22 18:59:37,954 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 7 [2024-11-22 18:59:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:37,954 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2024-11-22 18:59:37,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:59:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2024-11-22 18:59:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:59:37,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:37,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:37,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:59:37,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:37,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:37,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2097530290, now seen corresponding path program 1 times [2024-11-22 18:59:37,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:37,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507052643] [2024-11-22 18:59:37,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:37,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:38,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:38,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507052643] [2024-11-22 18:59:38,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507052643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:38,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:38,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:59:38,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435925716] [2024-11-22 18:59:38,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:38,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:59:38,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:38,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:59:38,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:38,196 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:59:38,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:38,335 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2024-11-22 18:59:38,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:59:38,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-22 18:59:38,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:38,336 INFO L225 Difference]: With dead ends: 100 [2024-11-22 18:59:38,337 INFO L226 Difference]: Without dead ends: 100 [2024-11-22 18:59:38,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:38,338 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:38,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 334 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:59:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-22 18:59:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-22 18:59:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 96 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:59:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-22 18:59:38,347 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 14 [2024-11-22 18:59:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:38,348 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-22 18:59:38,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:59:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-22 18:59:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:59:38,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:38,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:38,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:59:38,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:38,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:38,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2097530291, now seen corresponding path program 1 times [2024-11-22 18:59:38,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:38,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142084780] [2024-11-22 18:59:38,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:38,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:38,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:38,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142084780] [2024-11-22 18:59:38,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142084780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:38,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:38,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:59:38,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657956492] [2024-11-22 18:59:38,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:38,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:59:38,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:38,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:59:38,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:38,439 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:59:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:38,667 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2024-11-22 18:59:38,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:59:38,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-22 18:59:38,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:38,668 INFO L225 Difference]: With dead ends: 98 [2024-11-22 18:59:38,668 INFO L226 Difference]: Without dead ends: 98 [2024-11-22 18:59:38,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:38,672 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:38,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 318 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:59:38,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-22 18:59:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-22 18:59:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 94 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:59:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-11-22 18:59:38,681 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 14 [2024-11-22 18:59:38,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:38,681 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-11-22 18:59:38,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:59:38,682 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-11-22 18:59:38,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:59:38,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:38,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:38,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:59:38,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:38,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:38,683 INFO L85 PathProgramCache]: Analyzing trace with hash -493202511, now seen corresponding path program 1 times [2024-11-22 18:59:38,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:38,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634234148] [2024-11-22 18:59:38,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:38,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:38,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:38,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634234148] [2024-11-22 18:59:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634234148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:38,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:38,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:59:38,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436060734] [2024-11-22 18:59:38,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:38,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:59:38,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:38,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:59:38,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:59:38,746 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:59:38,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:38,753 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2024-11-22 18:59:38,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:59:38,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2024-11-22 18:59:38,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:38,755 INFO L225 Difference]: With dead ends: 108 [2024-11-22 18:59:38,756 INFO L226 Difference]: Without dead ends: 108 [2024-11-22 18:59:38,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:59:38,757 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 9 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:38,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 207 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:59:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-22 18:59:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2024-11-22 18:59:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:59:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-22 18:59:38,770 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 16 [2024-11-22 18:59:38,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:38,770 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-22 18:59:38,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:59:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-22 18:59:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:59:38,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:38,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:38,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:59:38,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:38,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:38,771 INFO L85 PathProgramCache]: Analyzing trace with hash -45722425, now seen corresponding path program 1 times [2024-11-22 18:59:38,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:38,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372134265] [2024-11-22 18:59:38,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:38,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:38,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:38,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372134265] [2024-11-22 18:59:38,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372134265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:38,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:38,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:59:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817182825] [2024-11-22 18:59:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:38,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:59:38,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:38,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:59:38,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:59:38,833 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:59:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:38,846 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2024-11-22 18:59:38,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:59:38,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-22 18:59:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:38,848 INFO L225 Difference]: With dead ends: 104 [2024-11-22 18:59:38,848 INFO L226 Difference]: Without dead ends: 104 [2024-11-22 18:59:38,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:59:38,849 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:38,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:59:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-22 18:59:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-22 18:59:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 99 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2024-11-22 18:59:38,859 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 17 [2024-11-22 18:59:38,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:38,859 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2024-11-22 18:59:38,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:59:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2024-11-22 18:59:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 18:59:38,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:38,861 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:38,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:59:38,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:38,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:38,862 INFO L85 PathProgramCache]: Analyzing trace with hash 714012245, now seen corresponding path program 1 times [2024-11-22 18:59:38,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:38,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469326505] [2024-11-22 18:59:38,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:38,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 18:59:38,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:38,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469326505] [2024-11-22 18:59:38,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469326505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:38,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523677515] [2024-11-22 18:59:38,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:38,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:38,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:38,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:38,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 18:59:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:39,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:59:39,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:39,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 18:59:39,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523677515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:59:39,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:59:39,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-22 18:59:39,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670343206] [2024-11-22 18:59:39,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:39,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:59:39,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:39,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:59:39,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:59:39,162 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:59:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:39,174 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2024-11-22 18:59:39,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:59:39,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-11-22 18:59:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:39,175 INFO L225 Difference]: With dead ends: 106 [2024-11-22 18:59:39,175 INFO L226 Difference]: Without dead ends: 106 [2024-11-22 18:59:39,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:59:39,176 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 9 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:39,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 307 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:59:39,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-22 18:59:39,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-22 18:59:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 101 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2024-11-22 18:59:39,182 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 31 [2024-11-22 18:59:39,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:39,182 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2024-11-22 18:59:39,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:59:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2024-11-22 18:59:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-22 18:59:39,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:39,183 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:39,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 18:59:39,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:39,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:39,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:39,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1276770653, now seen corresponding path program 1 times [2024-11-22 18:59:39,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:39,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004324608] [2024-11-22 18:59:39,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:39,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:39,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:39,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004324608] [2024-11-22 18:59:39,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004324608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:39,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263694163] [2024-11-22 18:59:39,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:39,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:39,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:39,682 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:39,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 18:59:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:39,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 18:59:39,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:39,803 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-22 18:59:39,893 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-22 18:59:39,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-22 18:59:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:39,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:39,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263694163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:39,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:39,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2024-11-22 18:59:39,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292790844] [2024-11-22 18:59:39,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:39,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:59:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:39,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:59:39,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2024-11-22 18:59:39,945 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-22 18:59:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:40,229 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2024-11-22 18:59:40,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:59:40,230 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-11-22 18:59:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:40,231 INFO L225 Difference]: With dead ends: 105 [2024-11-22 18:59:40,231 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 18:59:40,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2024-11-22 18:59:40,231 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 5 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:40,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 572 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 504 Invalid, 0 Unknown, 106 Unchecked, 0.2s Time] [2024-11-22 18:59:40,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 18:59:40,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-22 18:59:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 65 states have (on average 1.676923076923077) internal successors, (109), 100 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2024-11-22 18:59:40,235 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 32 [2024-11-22 18:59:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:40,235 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2024-11-22 18:59:40,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-22 18:59:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2024-11-22 18:59:40,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-22 18:59:40,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:40,236 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:40,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 18:59:40,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-22 18:59:40,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:40,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:40,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1276770652, now seen corresponding path program 1 times [2024-11-22 18:59:40,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:40,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081446906] [2024-11-22 18:59:40,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:40,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:40,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081446906] [2024-11-22 18:59:40,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081446906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468078894] [2024-11-22 18:59:40,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:40,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:40,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:40,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:40,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 18:59:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:41,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 18:59:41,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:41,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:59:41,122 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-22 18:59:41,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:41,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:59:41,168 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:59:41,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:59:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-22 18:59:41,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:41,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468078894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:41,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:41,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2024-11-22 18:59:41,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248457119] [2024-11-22 18:59:41,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:41,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 18:59:41,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:41,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 18:59:41,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=262, Unknown=1, NotChecked=32, Total=342 [2024-11-22 18:59:41,348 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-22 18:59:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:41,929 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2024-11-22 18:59:41,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:59:41,930 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-11-22 18:59:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:41,934 INFO L225 Difference]: With dead ends: 104 [2024-11-22 18:59:41,934 INFO L226 Difference]: Without dead ends: 104 [2024-11-22 18:59:41,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=394, Unknown=1, NotChecked=40, Total=506 [2024-11-22 18:59:41,934 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:41,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 609 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 570 Invalid, 0 Unknown, 105 Unchecked, 0.5s Time] [2024-11-22 18:59:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-22 18:59:41,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-22 18:59:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 99 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2024-11-22 18:59:41,941 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 32 [2024-11-22 18:59:41,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:41,941 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2024-11-22 18:59:41,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-22 18:59:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2024-11-22 18:59:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 18:59:41,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:41,942 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:41,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 18:59:42,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:42,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:42,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:42,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1274296113, now seen corresponding path program 2 times [2024-11-22 18:59:42,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:42,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136725475] [2024-11-22 18:59:42,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:59:42,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:42,169 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:59:42,169 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:59:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 18:59:42,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:42,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136725475] [2024-11-22 18:59:42,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136725475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:42,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137201401] [2024-11-22 18:59:42,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:59:42,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:42,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:42,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:42,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 18:59:42,377 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:59:42,377 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:59:42,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 18:59:42,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:42,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:59:42,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:42,501 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 18:59:42,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-22 18:59:42,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-22 18:59:42,675 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-22 18:59:42,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2024-11-22 18:59:42,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:42,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:42,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:59:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 18:59:42,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:42,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137201401] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:42,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:42,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 20 [2024-11-22 18:59:42,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578598002] [2024-11-22 18:59:42,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:42,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 18:59:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:42,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 18:59:42,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=388, Unknown=9, NotChecked=0, Total=462 [2024-11-22 18:59:42,942 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 17 states have internal predecessors, (73), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:59:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:43,670 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-11-22 18:59:43,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 18:59:43,671 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 17 states have internal predecessors, (73), 6 states have call successors, (6), 2 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 46 [2024-11-22 18:59:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:43,672 INFO L225 Difference]: With dead ends: 111 [2024-11-22 18:59:43,672 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 18:59:43,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=765, Unknown=15, NotChecked=0, Total=930 [2024-11-22 18:59:43,673 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 103 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 9 mSolverCounterUnsat, 96 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 96 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:43,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 552 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 701 Invalid, 96 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:59:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 18:59:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2024-11-22 18:59:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-22 18:59:43,676 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 46 [2024-11-22 18:59:43,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:43,676 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-22 18:59:43,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 17 states have internal predecessors, (73), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:59:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-22 18:59:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-22 18:59:43,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:43,677 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:43,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 18:59:43,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:43,882 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:43,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2029013930, now seen corresponding path program 1 times [2024-11-22 18:59:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:43,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69196620] [2024-11-22 18:59:43,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:43,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-22 18:59:44,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:44,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69196620] [2024-11-22 18:59:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69196620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:44,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59370308] [2024-11-22 18:59:44,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:44,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:44,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:44,411 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:44,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 18:59:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:44,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 18:59:44,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:44,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:59:44,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:44,599 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-22 18:59:44,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:44,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:59:44,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:44,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:44,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:59:44,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:44,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:44,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:59:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-22 18:59:44,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:59:44,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59370308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:44,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:59:44,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-22 18:59:44,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628294930] [2024-11-22 18:59:44,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:44,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:59:44,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:44,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:59:44,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2024-11-22 18:59:44,891 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:59:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:45,001 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2024-11-22 18:59:45,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:59:45,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2024-11-22 18:59:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:45,002 INFO L225 Difference]: With dead ends: 96 [2024-11-22 18:59:45,002 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 18:59:45,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2024-11-22 18:59:45,003 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:45,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 232 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 125 Unchecked, 0.1s Time] [2024-11-22 18:59:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 18:59:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-22 18:59:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.523076923076923) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2024-11-22 18:59:45,005 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 47 [2024-11-22 18:59:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:45,005 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2024-11-22 18:59:45,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:59:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2024-11-22 18:59:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-22 18:59:45,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:45,006 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:45,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-22 18:59:45,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-22 18:59:45,211 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:45,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:45,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1423390737, now seen corresponding path program 1 times [2024-11-22 18:59:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:45,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608277539] [2024-11-22 18:59:45,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 18:59:45,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:45,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608277539] [2024-11-22 18:59:45,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608277539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:45,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676689402] [2024-11-22 18:59:45,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:45,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:45,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:45,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:45,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 18:59:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:45,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-22 18:59:45,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:45,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:59:45,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 18:59:45,795 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-22 18:59:45,811 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-22 18:59:45,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-22 18:59:45,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 18:59:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 7 not checked. [2024-11-22 18:59:45,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:45,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-22 18:59:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:59:45,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676689402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:59:45,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:59:45,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 22 [2024-11-22 18:59:45,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586709318] [2024-11-22 18:59:45,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:45,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-22 18:59:45,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:45,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-22 18:59:45,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=405, Unknown=1, NotChecked=40, Total=506 [2024-11-22 18:59:45,991 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 20 states have internal predecessors, (79), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-22 18:59:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:46,382 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2024-11-22 18:59:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 18:59:46,383 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 20 states have internal predecessors, (79), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 51 [2024-11-22 18:59:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:46,384 INFO L225 Difference]: With dead ends: 95 [2024-11-22 18:59:46,384 INFO L226 Difference]: Without dead ends: 95 [2024-11-22 18:59:46,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=667, Unknown=1, NotChecked=52, Total=812 [2024-11-22 18:59:46,385 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 78 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:46,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 592 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 686 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2024-11-22 18:59:46,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-22 18:59:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-22 18:59:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.5) internal successors, (99), 90 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2024-11-22 18:59:46,387 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 51 [2024-11-22 18:59:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:46,387 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2024-11-22 18:59:46,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 20 states have internal predecessors, (79), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-22 18:59:46,388 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2024-11-22 18:59:46,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-22 18:59:46,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:46,390 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:46,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 18:59:46,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:46,590 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:46,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1423390736, now seen corresponding path program 1 times [2024-11-22 18:59:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:46,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234341859] [2024-11-22 18:59:46,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:46,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:59:47,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:47,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234341859] [2024-11-22 18:59:47,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234341859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:47,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441403310] [2024-11-22 18:59:47,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:47,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:47,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:47,095 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:47,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 18:59:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:47,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-22 18:59:47,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:47,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:59:47,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 18:59:47,616 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 18:59:47,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-22 18:59:47,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 18:59:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:59:47,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:47,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441403310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:47,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:47,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2024-11-22 18:59:47,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684947820] [2024-11-22 18:59:47,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:47,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 18:59:47,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:47,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 18:59:47,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2024-11-22 18:59:47,906 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 24 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 18:59:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:48,816 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2024-11-22 18:59:48,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 18:59:48,816 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 24 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2024-11-22 18:59:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:48,817 INFO L225 Difference]: With dead ends: 109 [2024-11-22 18:59:48,817 INFO L226 Difference]: Without dead ends: 109 [2024-11-22 18:59:48,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=1980, Unknown=0, NotChecked=0, Total=2162 [2024-11-22 18:59:48,818 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:48,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 926 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 18:59:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-22 18:59:48,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2024-11-22 18:59:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 100 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2024-11-22 18:59:48,830 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 51 [2024-11-22 18:59:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:48,830 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2024-11-22 18:59:48,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 24 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 18:59:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2024-11-22 18:59:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-22 18:59:48,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:48,831 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:48,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 18:59:49,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:49,037 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:49,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1423543604, now seen corresponding path program 1 times [2024-11-22 18:59:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:49,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493576415] [2024-11-22 18:59:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 18:59:49,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:49,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493576415] [2024-11-22 18:59:49,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493576415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:49,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643378282] [2024-11-22 18:59:49,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:49,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:49,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:49,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:49,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 18:59:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:49,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-22 18:59:49,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:49,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:59:49,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:59:49,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:49,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:49,523 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-22 18:59:49,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-22 18:59:49,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:59:49,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:49,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:49,591 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-22 18:59:49,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:49,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:59:49,621 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:59:49,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:59:49,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:49,688 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-22 18:59:49,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:49,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:59:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 21 not checked. [2024-11-22 18:59:49,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643378282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:49,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:49,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-11-22 18:59:49,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313269719] [2024-11-22 18:59:49,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:49,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 18:59:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:49,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 18:59:49,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=330, Unknown=2, NotChecked=74, Total=462 [2024-11-22 18:59:49,821 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 16 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 18:59:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:50,300 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2024-11-22 18:59:50,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 18:59:50,300 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 16 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2024-11-22 18:59:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:50,301 INFO L225 Difference]: With dead ends: 103 [2024-11-22 18:59:50,301 INFO L226 Difference]: Without dead ends: 103 [2024-11-22 18:59:50,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=738, Unknown=2, NotChecked=114, Total=992 [2024-11-22 18:59:50,302 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 112 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:50,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 589 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 721 Invalid, 0 Unknown, 180 Unchecked, 0.3s Time] [2024-11-22 18:59:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-22 18:59:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-22 18:59:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.4) internal successors, (105), 97 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2024-11-22 18:59:50,305 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 51 [2024-11-22 18:59:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:50,305 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2024-11-22 18:59:50,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 16 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 18:59:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2024-11-22 18:59:50,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-22 18:59:50,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:50,306 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:50,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-22 18:59:50,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-22 18:59:50,506 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:50,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:50,507 INFO L85 PathProgramCache]: Analyzing trace with hash -21300460, now seen corresponding path program 1 times [2024-11-22 18:59:50,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:50,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118788553] [2024-11-22 18:59:50,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-22 18:59:50,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:50,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118788553] [2024-11-22 18:59:50,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118788553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:50,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:50,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:59:50,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92191944] [2024-11-22 18:59:50,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:50,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:59:50,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:50,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:59:50,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:50,623 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:59:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:50,720 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2024-11-22 18:59:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:59:50,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2024-11-22 18:59:50,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:50,722 INFO L225 Difference]: With dead ends: 102 [2024-11-22 18:59:50,722 INFO L226 Difference]: Without dead ends: 102 [2024-11-22 18:59:50,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:50,722 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 8 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:50,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 263 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:59:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-22 18:59:50,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-22 18:59:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2024-11-22 18:59:50,724 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 54 [2024-11-22 18:59:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:50,725 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2024-11-22 18:59:50,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:59:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2024-11-22 18:59:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-22 18:59:50,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:50,727 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:50,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 18:59:50,727 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:50,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:50,727 INFO L85 PathProgramCache]: Analyzing trace with hash -21300459, now seen corresponding path program 1 times [2024-11-22 18:59:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:50,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862350975] [2024-11-22 18:59:50,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:50,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-22 18:59:50,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:50,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862350975] [2024-11-22 18:59:50,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862350975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:50,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:50,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:59:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56427136] [2024-11-22 18:59:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:50,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:59:50,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:50,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:59:50,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:50,894 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:59:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:50,988 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2024-11-22 18:59:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:59:50,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2024-11-22 18:59:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:50,990 INFO L225 Difference]: With dead ends: 101 [2024-11-22 18:59:50,990 INFO L226 Difference]: Without dead ends: 101 [2024-11-22 18:59:50,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:50,990 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:50,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 271 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:59:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-22 18:59:50,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-22 18:59:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2024-11-22 18:59:50,993 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 54 [2024-11-22 18:59:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:50,993 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2024-11-22 18:59:50,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:59:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2024-11-22 18:59:50,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-22 18:59:50,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:50,995 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:50,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 18:59:50,995 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:50,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash -660261595, now seen corresponding path program 1 times [2024-11-22 18:59:50,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:50,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705159432] [2024-11-22 18:59:50,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:50,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:51,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705159432] [2024-11-22 18:59:51,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705159432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:51,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896629498] [2024-11-22 18:59:51,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:51,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:51,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:51,913 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:51,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 18:59:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:52,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-22 18:59:52,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:52,633 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 18:59:52,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 18:59:52,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:59:52,786 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:59:52,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-22 18:59:52,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-22 18:59:52,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 18:59:53,115 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2024-11-22 18:59:53,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:53,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-11-22 18:59:53,155 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2024-11-22 18:59:53,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2024-11-22 18:59:53,284 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 66 treesize of output 38 [2024-11-22 18:59:53,421 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 33 treesize of output 17 [2024-11-22 18:59:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-22 18:59:53,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:53,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896629498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:53,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:53,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 47 [2024-11-22 18:59:53,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328711403] [2024-11-22 18:59:53,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:53,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-22 18:59:53,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:53,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-22 18:59:53,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2365, Unknown=1, NotChecked=98, Total=2652 [2024-11-22 18:59:53,681 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 48 states, 45 states have (on average 2.111111111111111) internal successors, (95), 42 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:59:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:54,935 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2024-11-22 18:59:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-22 18:59:54,936 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.111111111111111) internal successors, (95), 42 states have internal predecessors, (95), 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 55 [2024-11-22 18:59:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:54,936 INFO L225 Difference]: With dead ends: 113 [2024-11-22 18:59:54,937 INFO L226 Difference]: Without dead ends: 113 [2024-11-22 18:59:54,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=335, Invalid=4224, Unknown=1, NotChecked=132, Total=4692 [2024-11-22 18:59:54,938 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 85 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:54,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 997 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1433 Invalid, 0 Unknown, 123 Unchecked, 0.8s Time] [2024-11-22 18:59:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-22 18:59:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2024-11-22 18:59:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2024-11-22 18:59:54,942 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 55 [2024-11-22 18:59:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:54,943 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2024-11-22 18:59:54,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.111111111111111) internal successors, (95), 42 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:59:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2024-11-22 18:59:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-22 18:59:54,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:54,944 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:54,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-22 18:59:55,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-22 18:59:55,145 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 18:59:55,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:55,145 INFO L85 PathProgramCache]: Analyzing trace with hash -660261594, now seen corresponding path program 1 times [2024-11-22 18:59:55,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:55,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161547443] [2024-11-22 18:59:55,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:55,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:56,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:56,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161547443] [2024-11-22 18:59:56,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161547443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:56,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473524183] [2024-11-22 18:59:56,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:56,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:56,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:56,652 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:56,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 18:59:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:56,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-22 18:59:56,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:56,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:59:56,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:59:57,209 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:59:57,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:59:57,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:59:57,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:59:57,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:59:57,427 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:59:57,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-11-22 18:59:57,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-22 18:59:57,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-22 18:59:57,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-22 18:59:57,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 18:59:57,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:57,938 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-22 18:59:57,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:57,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2024-11-22 18:59:58,007 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-22 18:59:58,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-22 18:59:58,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2024-11-22 18:59:58,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-22 18:59:58,147 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 28 [2024-11-22 18:59:58,253 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 25 treesize of output 13 [2024-11-22 18:59:58,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 18:59:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-22 18:59:58,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:58,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473524183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:58,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:58,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 50 [2024-11-22 18:59:58,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771868961] [2024-11-22 18:59:58,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:58,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-22 18:59:58,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:58,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-22 18:59:58,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2921, Unknown=1, NotChecked=108, Total=3192 [2024-11-22 18:59:58,693 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 51 states, 48 states have (on average 1.9375) internal successors, (93), 44 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 19:00:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:00,840 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-11-22 19:00:00,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-22 19:00:00,841 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.9375) internal successors, (93), 44 states have internal predecessors, (93), 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 55 [2024-11-22 19:00:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:00,843 INFO L225 Difference]: With dead ends: 108 [2024-11-22 19:00:00,843 INFO L226 Difference]: Without dead ends: 108 [2024-11-22 19:00:00,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=330, Invalid=5525, Unknown=1, NotChecked=150, Total=6006 [2024-11-22 19:00:00,845 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 80 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 2147 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:00,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1347 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2147 Invalid, 0 Unknown, 115 Unchecked, 1.2s Time] [2024-11-22 19:00:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-22 19:00:00,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-11-22 19:00:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 99 states have internal predecessors, (108), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 19:00:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2024-11-22 19:00:00,848 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 55 [2024-11-22 19:00:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:00,848 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2024-11-22 19:00:00,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.9375) internal successors, (93), 44 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 19:00:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2024-11-22 19:00:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 19:00:00,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:00,849 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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-11-22 19:00:00,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-22 19:00:01,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-22 19:00:01,057 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 19:00:01,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:01,057 INFO L85 PathProgramCache]: Analyzing trace with hash -350480549, now seen corresponding path program 2 times [2024-11-22 19:00:01,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:01,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582262656] [2024-11-22 19:00:01,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:00:01,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:01,090 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 19:00:01,091 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:00:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:03,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:03,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582262656] [2024-11-22 19:00:03,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582262656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:03,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241269677] [2024-11-22 19:00:03,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:00:03,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:03,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:03,300 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:03,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-22 19:00:03,484 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 19:00:03,484 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:00:03,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 131 conjuncts are in the unsatisfiable core [2024-11-22 19:00:03,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:03,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 19:00:03,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 19:00:03,879 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 19:00:03,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 19:00:03,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 19:00:03,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 19:00:03,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 19:00:03,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 19:00:04,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-22 19:00:04,047 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 21 treesize of output 20 [2024-11-22 19:00:04,135 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-22 19:00:04,136 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 114 treesize of output 65 [2024-11-22 19:00:04,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 29 [2024-11-22 19:00:04,418 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-22 19:00:04,419 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 84 treesize of output 27 [2024-11-22 19:00:04,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-22 19:00:04,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 19:00:04,455 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-22 19:00:04,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:04,480 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-22 19:00:04,480 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 92 treesize of output 75 [2024-11-22 19:00:04,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:04,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:04,491 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 47 treesize of output 45 [2024-11-22 19:00:04,502 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-22 19:00:04,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-22 19:00:04,584 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 89 treesize of output 65 [2024-11-22 19:00:04,585 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 69 treesize of output 49 [2024-11-22 19:00:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 6 not checked. [2024-11-22 19:00:04,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:05,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241269677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:05,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:00:05,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 54 [2024-11-22 19:00:05,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932464649] [2024-11-22 19:00:05,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:05,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-22 19:00:05,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:05,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-22 19:00:05,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3252, Unknown=1, NotChecked=114, Total=3540 [2024-11-22 19:00:05,424 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 54 states, 52 states have (on average 1.75) internal successors, (91), 49 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 19:00:06,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:06,813 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2024-11-22 19:00:06,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-22 19:00:06,813 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.75) internal successors, (91), 49 states have internal predecessors, (91), 6 states have call successors, (6), 2 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 59 [2024-11-22 19:00:06,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:06,815 INFO L225 Difference]: With dead ends: 130 [2024-11-22 19:00:06,815 INFO L226 Difference]: Without dead ends: 130 [2024-11-22 19:00:06,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=264, Invalid=5141, Unknown=1, NotChecked=144, Total=5550 [2024-11-22 19:00:06,816 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 14 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:06,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1842 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1693 Invalid, 0 Unknown, 124 Unchecked, 0.8s Time] [2024-11-22 19:00:06,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-22 19:00:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2024-11-22 19:00:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 119 states have internal predecessors, (130), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 19:00:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2024-11-22 19:00:06,819 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 59 [2024-11-22 19:00:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:06,820 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2024-11-22 19:00:06,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.75) internal successors, (91), 49 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 19:00:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2024-11-22 19:00:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 19:00:06,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:06,820 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:06,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-22 19:00:07,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:07,025 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 19:00:07,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:07,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1698252194, now seen corresponding path program 1 times [2024-11-22 19:00:07,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:07,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912746773] [2024-11-22 19:00:07,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:07,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-22 19:00:07,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:07,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912746773] [2024-11-22 19:00:07,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912746773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:07,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:07,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 19:00:07,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681926263] [2024-11-22 19:00:07,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:07,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 19:00:07,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:07,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 19:00:07,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 19:00:07,190 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 19:00:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:07,339 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2024-11-22 19:00:07,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 19:00:07,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 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 59 [2024-11-22 19:00:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:07,343 INFO L225 Difference]: With dead ends: 145 [2024-11-22 19:00:07,343 INFO L226 Difference]: Without dead ends: 145 [2024-11-22 19:00:07,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-22 19:00:07,344 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 74 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:07,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 366 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:07,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-22 19:00:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 124. [2024-11-22 19:00:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.28) internal successors, (128), 116 states have internal predecessors, (128), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 19:00:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 138 transitions. [2024-11-22 19:00:07,357 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 138 transitions. Word has length 59 [2024-11-22 19:00:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:07,357 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 138 transitions. [2024-11-22 19:00:07,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 19:00:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 138 transitions. [2024-11-22 19:00:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 19:00:07,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:07,358 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:07,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 19:00:07,359 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 19:00:07,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:07,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1698252193, now seen corresponding path program 1 times [2024-11-22 19:00:07,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:07,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604758338] [2024-11-22 19:00:07,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:07,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 19:00:07,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:07,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604758338] [2024-11-22 19:00:07,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604758338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:07,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059305232] [2024-11-22 19:00:07,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:07,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:07,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:07,822 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:07,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-22 19:00:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:08,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-22 19:00:08,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:08,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 19:00:08,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 19:00:08,254 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 19:00:08,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-22 19:00:08,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 19:00:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 19:00:08,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:08,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059305232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:08,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:00:08,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2024-11-22 19:00:08,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789842607] [2024-11-22 19:00:08,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:08,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 19:00:08,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:08,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 19:00:08,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2024-11-22 19:00:08,520 INFO L87 Difference]: Start difference. First operand 124 states and 138 transitions. Second operand has 26 states, 25 states have (on average 3.28) internal successors, (82), 23 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 19:00:09,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:09,124 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2024-11-22 19:00:09,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 19:00:09,124 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.28) internal successors, (82), 23 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 59 [2024-11-22 19:00:09,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:09,126 INFO L225 Difference]: With dead ends: 151 [2024-11-22 19:00:09,126 INFO L226 Difference]: Without dead ends: 151 [2024-11-22 19:00:09,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=1417, Unknown=0, NotChecked=0, Total=1560 [2024-11-22 19:00:09,128 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 136 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:09,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 798 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 19:00:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-22 19:00:09,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 128. [2024-11-22 19:00:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.2666666666666666) internal successors, (133), 120 states have internal predecessors, (133), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 19:00:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2024-11-22 19:00:09,131 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 59 [2024-11-22 19:00:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:09,131 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2024-11-22 19:00:09,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.28) internal successors, (82), 23 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 19:00:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2024-11-22 19:00:09,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-22 19:00:09,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:09,132 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:09,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-22 19:00:09,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-22 19:00:09,334 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 19:00:09,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:09,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1011606114, now seen corresponding path program 1 times [2024-11-22 19:00:09,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:09,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589188106] [2024-11-22 19:00:09,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:09,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:10,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:10,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589188106] [2024-11-22 19:00:10,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589188106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:10,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623655380] [2024-11-22 19:00:10,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:10,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:10,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:10,271 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:10,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-22 19:00:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:10,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-22 19:00:10,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:10,673 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 19:00:10,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 19:00:10,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 19:00:10,826 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 19:00:10,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2024-11-22 19:00:10,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 18 [2024-11-22 19:00:10,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 19:00:11,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:11,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 51 [2024-11-22 19:00:11,061 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-22 19:00:11,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-22 19:00:11,293 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2024-11-22 19:00:11,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 46 [2024-11-22 19:00:11,372 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-22 19:00:11,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 93 [2024-11-22 19:00:11,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2024-11-22 19:00:11,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-22 19:00:11,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-22 19:00:11,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-22 19:00:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:11,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:11,688 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2797 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2797) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2024-11-22 19:00:12,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623655380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:12,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:00:12,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32] total 52 [2024-11-22 19:00:12,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532922130] [2024-11-22 19:00:12,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:12,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-22 19:00:12,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:12,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-22 19:00:12,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3351, Unknown=3, NotChecked=116, Total=3660 [2024-11-22 19:00:12,082 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand has 52 states, 50 states have (on average 2.0) internal successors, (100), 45 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 19:00:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:13,952 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2024-11-22 19:00:13,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-22 19:00:13,953 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.0) internal successors, (100), 45 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 64 [2024-11-22 19:00:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:13,953 INFO L225 Difference]: With dead ends: 132 [2024-11-22 19:00:13,954 INFO L226 Difference]: Without dead ends: 132 [2024-11-22 19:00:13,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=467, Invalid=7016, Unknown=3, NotChecked=170, Total=7656 [2024-11-22 19:00:13,956 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 128 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:13,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1508 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 19:00:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-22 19:00:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2024-11-22 19:00:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 120 states have internal predecessors, (130), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 19:00:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2024-11-22 19:00:13,958 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 64 [2024-11-22 19:00:13,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:13,959 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2024-11-22 19:00:13,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.0) internal successors, (100), 45 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 19:00:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2024-11-22 19:00:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 19:00:13,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:13,959 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:13,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-22 19:00:14,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-22 19:00:14,164 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 19:00:14,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash -283646894, now seen corresponding path program 1 times [2024-11-22 19:00:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:14,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533209620] [2024-11-22 19:00:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-22 19:00:14,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:14,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533209620] [2024-11-22 19:00:14,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533209620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:14,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:14,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 19:00:14,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674515383] [2024-11-22 19:00:14,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:14,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 19:00:14,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:14,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 19:00:14,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 19:00:14,272 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 19:00:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:14,323 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2024-11-22 19:00:14,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 19:00:14,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2024-11-22 19:00:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:14,326 INFO L225 Difference]: With dead ends: 131 [2024-11-22 19:00:14,326 INFO L226 Difference]: Without dead ends: 131 [2024-11-22 19:00:14,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:00:14,327 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 8 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:14,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 269 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:00:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-22 19:00:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2024-11-22 19:00:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 119 states have internal predecessors, (128), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 19:00:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2024-11-22 19:00:14,331 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 71 [2024-11-22 19:00:14,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:14,332 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2024-11-22 19:00:14,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 19:00:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2024-11-22 19:00:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 19:00:14,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:14,332 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:14,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 19:00:14,333 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 19:00:14,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:14,333 INFO L85 PathProgramCache]: Analyzing trace with hash -240688272, now seen corresponding path program 1 times [2024-11-22 19:00:14,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:14,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641228426] [2024-11-22 19:00:14,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:14,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:15,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:15,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641228426] [2024-11-22 19:00:15,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641228426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:15,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347214592] [2024-11-22 19:00:15,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:15,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:15,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:15,832 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:15,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-22 19:00:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:16,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 123 conjuncts are in the unsatisfiable core [2024-11-22 19:00:16,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:16,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 19:00:16,753 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 19:00:16,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-11-22 19:00:16,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 19:00:16,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 19:00:16,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 19:00:17,032 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 19:00:17,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-22 19:00:17,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-22 19:00:17,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-22 19:00:17,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 19:00:17,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-22 19:00:17,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:17,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-11-22 19:00:17,574 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-22 19:00:17,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-22 19:00:17,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-22 19:00:17,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-22 19:00:18,146 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 20 treesize of output 15 [2024-11-22 19:00:18,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-22 19:00:18,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-22 19:00:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:18,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:18,688 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_#t~mem11#1.base| v_ArrVal_3132) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3133) (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-11-22 19:00:18,693 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= (select (select (store (store |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) v_ArrVal_3132) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3133) (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|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2024-11-22 19:00:19,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347214592] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:19,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:00:19,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 64 [2024-11-22 19:00:19,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575463054] [2024-11-22 19:00:19,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:19,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-22 19:00:19,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:19,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-22 19:00:19,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=4447, Unknown=118, NotChecked=274, Total=5112 [2024-11-22 19:00:19,105 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 64 states, 62 states have (on average 1.967741935483871) internal successors, (122), 55 states have internal predecessors, (122), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 19:00:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:21,108 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2024-11-22 19:00:21,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-22 19:00:21,109 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 62 states have (on average 1.967741935483871) internal successors, (122), 55 states have internal predecessors, (122), 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 71 [2024-11-22 19:00:21,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:21,113 INFO L225 Difference]: With dead ends: 158 [2024-11-22 19:00:21,113 INFO L226 Difference]: Without dead ends: 158 [2024-11-22 19:00:21,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=488, Invalid=7409, Unknown=121, NotChecked=354, Total=8372 [2024-11-22 19:00:21,116 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 104 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:21,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1585 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 19:00:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-22 19:00:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2024-11-22 19:00:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.208695652173913) internal successors, (139), 130 states have internal predecessors, (139), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 19:00:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2024-11-22 19:00:21,122 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 71 [2024-11-22 19:00:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:21,123 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2024-11-22 19:00:21,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 62 states have (on average 1.967741935483871) internal successors, (122), 55 states have internal predecessors, (122), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 19:00:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2024-11-22 19:00:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 19:00:21,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:21,127 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:21,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-22 19:00:21,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:21,328 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 19:00:21,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash -240679416, now seen corresponding path program 1 times [2024-11-22 19:00:21,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:21,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911289119] [2024-11-22 19:00:21,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:21,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:22,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911289119] [2024-11-22 19:00:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911289119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246861841] [2024-11-22 19:00:22,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:22,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:22,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:22,785 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:22,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-22 19:00:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:23,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-22 19:00:23,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:23,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 19:00:23,116 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 19:00:23,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 19:00:23,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 19:00:23,253 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 19:00:23,254 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 41 [2024-11-22 19:00:23,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 14 [2024-11-22 19:00:23,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 19:00:23,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:23,540 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 50 treesize of output 39 [2024-11-22 19:00:23,563 INFO L349 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2024-11-22 19:00:23,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 64 [2024-11-22 19:00:23,802 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-11-22 19:00:23,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 60 [2024-11-22 19:00:23,942 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-22 19:00:23,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 98 [2024-11-22 19:00:23,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 19:00:24,164 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 164 treesize of output 116 [2024-11-22 19:00:24,169 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 115 treesize of output 87 [2024-11-22 19:00:24,483 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 93 treesize of output 51 [2024-11-22 19:00:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 19:00:24,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:29,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246861841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:29,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:00:29,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28] total 54 [2024-11-22 19:00:29,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44175246] [2024-11-22 19:00:29,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:29,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-22 19:00:29,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:29,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-22 19:00:29,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3595, Unknown=2, NotChecked=0, Total=3782 [2024-11-22 19:00:29,166 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 55 states, 52 states have (on average 2.230769230769231) internal successors, (116), 48 states have internal predecessors, (116), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 19:00:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:31,983 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2024-11-22 19:00:31,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-22 19:00:31,984 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 52 states have (on average 2.230769230769231) internal successors, (116), 48 states have internal predecessors, (116), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 71 [2024-11-22 19:00:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:31,985 INFO L225 Difference]: With dead ends: 174 [2024-11-22 19:00:31,985 INFO L226 Difference]: Without dead ends: 174 [2024-11-22 19:00:31,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=495, Invalid=7875, Unknown=2, NotChecked=0, Total=8372 [2024-11-22 19:00:31,986 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 206 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:31,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1767 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 19:00:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-22 19:00:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 140. [2024-11-22 19:00:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 132 states have internal predecessors, (142), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 19:00:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2024-11-22 19:00:31,989 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 71 [2024-11-22 19:00:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:31,989 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2024-11-22 19:00:31,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 52 states have (on average 2.230769230769231) internal successors, (116), 48 states have internal predecessors, (116), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 19:00:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2024-11-22 19:00:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 19:00:31,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:31,990 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:32,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-22 19:00:32,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:32,193 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 19:00:32,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash -240679415, now seen corresponding path program 1 times [2024-11-22 19:00:32,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:32,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552449074] [2024-11-22 19:00:32,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:32,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:34,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:34,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552449074] [2024-11-22 19:00:34,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552449074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:34,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996270875] [2024-11-22 19:00:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:34,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:34,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:34,239 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:34,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-22 19:00:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:34,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-22 19:00:34,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:34,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 19:00:34,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 19:00:34,897 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 19:00:34,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-22 19:00:34,913 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 19:00:34,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 19:00:35,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 19:00:35,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 19:00:35,109 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 19:00:35,109 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 73 treesize of output 66 [2024-11-22 19:00:35,113 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 30 treesize of output 13 [2024-11-22 19:00:35,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 19 [2024-11-22 19:00:35,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-22 19:00:35,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 19:00:35,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 19:00:35,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:35,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 52 [2024-11-22 19:00:35,675 INFO L349 Elim1Store]: treesize reduction 41, result has 47.4 percent of original size [2024-11-22 19:00:35,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 41 [2024-11-22 19:00:35,693 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-22 19:00:35,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-22 19:00:35,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-22 19:00:36,160 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-11-22 19:00:36,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 60 [2024-11-22 19:00:36,173 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2024-11-22 19:00:36,174 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 40 treesize of output 33 [2024-11-22 19:00:36,319 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-22 19:00:36,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 107 [2024-11-22 19:00:36,334 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-22 19:00:36,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 140 [2024-11-22 19:00:36,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 19:00:36,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 19:00:36,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 19:00:38,070 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 436 treesize of output 328 [2024-11-22 19:00:38,074 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 332 treesize of output 264 [2024-11-22 19:00:38,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:38,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 261 treesize of output 177 [2024-11-22 19:00:38,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:38,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 165 [2024-11-22 19:00:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:39,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:41,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996270875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:41,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:00:41,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 63 [2024-11-22 19:00:41,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378448880] [2024-11-22 19:00:41,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:41,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-22 19:00:41,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:41,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-22 19:00:41,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=5275, Unknown=0, NotChecked=0, Total=5550 [2024-11-22 19:00:41,166 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand has 64 states, 61 states have (on average 2.081967213114754) internal successors, (127), 55 states have internal predecessors, (127), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 19:00:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:45,961 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2024-11-22 19:00:45,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-22 19:00:45,962 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 61 states have (on average 2.081967213114754) internal successors, (127), 55 states have internal predecessors, (127), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 71 [2024-11-22 19:00:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:45,963 INFO L225 Difference]: With dead ends: 184 [2024-11-22 19:00:45,963 INFO L226 Difference]: Without dead ends: 184 [2024-11-22 19:00:45,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2749 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=750, Invalid=11460, Unknown=0, NotChecked=0, Total=12210 [2024-11-22 19:00:45,964 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 291 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 2807 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:45,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1602 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2807 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-22 19:00:45,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-22 19:00:45,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 145. [2024-11-22 19:00:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 137 states have internal predecessors, (148), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 19:00:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2024-11-22 19:00:45,967 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 71 [2024-11-22 19:00:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:45,967 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2024-11-22 19:00:45,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 61 states have (on average 2.081967213114754) internal successors, (127), 55 states have internal predecessors, (127), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 19:00:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2024-11-22 19:00:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-22 19:00:45,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:45,968 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:45,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-22 19:00:46,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-22 19:00:46,173 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 19:00:46,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:46,174 INFO L85 PathProgramCache]: Analyzing trace with hash -485300561, now seen corresponding path program 3 times [2024-11-22 19:00:46,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:46,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397151857] [2024-11-22 19:00:46,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 19:00:46,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:46,211 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-22 19:00:46,211 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:00:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 19:00:47,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:47,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397151857] [2024-11-22 19:00:47,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397151857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:47,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049653438] [2024-11-22 19:00:47,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 19:00:47,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:47,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:47,960 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:47,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-22 19:00:48,392 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-22 19:00:48,392 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:00:48,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 139 conjuncts are in the unsatisfiable core [2024-11-22 19:00:48,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:48,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 19:00:48,591 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-11-22 19:00:48,661 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-22 19:00:48,661 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 37 treesize of output 27 [2024-11-22 19:00:48,928 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (or (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_#memory_$Pointer$#2.base|)) (.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= .cse0 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse3 (select |c_#valid| .cse3)))))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |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)) is different from false [2024-11-22 19:00:48,931 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (or (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_#memory_$Pointer$#2.base|)) (.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= .cse0 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse3 (select |c_#valid| .cse3)))))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |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)) is different from true [2024-11-22 19:00:48,977 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (or (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_#memory_$Pointer$#2.base|)) (.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse3 (select |c_#valid| .cse3)))))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |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)) is different from false [2024-11-22 19:00:48,980 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (or (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_#memory_$Pointer$#2.base|)) (.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse3 (select |c_#valid| .cse3)))))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |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)) is different from true [2024-11-22 19:00:49,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:49,008 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-22 19:00:49,008 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 35 treesize of output 34 [2024-11-22 19:00:49,042 WARN L851 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |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) (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int)))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse4 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3 (select |v_#memory_$Pointer$#2.base_224| .cse3)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |c_#valid| .cse5)))))) (= (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_$Pointer$#2.base|)))))) is different from false [2024-11-22 19:00:49,045 WARN L873 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |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) (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int)))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse4 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3 (select |v_#memory_$Pointer$#2.base_224| .cse3)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |c_#valid| .cse5)))))) (= (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_$Pointer$#2.base|)))))) is different from true [2024-11-22 19:00:49,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 19:00:49,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 19:00:49,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:49,113 INFO L349 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2024-11-22 19:00:49,113 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 38 treesize of output 37 [2024-11-22 19:00:49,133 WARN L851 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |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_dll_create_~head~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse5 (= (select .cse1 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4))) (and (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) |c_#memory_$Pointer$#2.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0 (select |v_#memory_$Pointer$#2.base_224| .cse0)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse3 (select |c_#valid| .cse3))))))) .cse5) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse7 (select |c_#valid| .cse7)))))) .cse5 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))))) is different from false [2024-11-22 19:00:49,136 WARN L873 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |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_dll_create_~head~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse5 (= (select .cse1 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4))) (and (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) |c_#memory_$Pointer$#2.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0 (select |v_#memory_$Pointer$#2.base_224| .cse0)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse3 (select |c_#valid| .cse3))))))) .cse5) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse7 (select |c_#valid| .cse7)))))) .cse5 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))))) is different from true [2024-11-22 19:00:49,227 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-22 19:00:49,228 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 197 treesize of output 180 [2024-11-22 19:00:49,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:49,325 INFO L349 Elim1Store]: treesize reduction 65, result has 24.4 percent of original size [2024-11-22 19:00:49,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 56 [2024-11-22 19:00:49,345 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 6 treesize of output 4 [2024-11-22 19:00:49,375 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 93 treesize of output 75 [2024-11-22 19:00:49,462 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse7 4))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse5 (+ .cse9 4)) (.cse3 (= (select |c_#valid| .cse0) 1))) (or (let ((.cse1 (select .cse4 .cse5))) (and (or (= .cse0 .cse1) (exists ((v_prenex_30 Int)) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_30 8))))) (exists ((v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select v_prenex_29 .cse1) 1))) .cse3)) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0) .cse5))) (and (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7) .cse0 (let ((.cse8 (+ 8 .cse9))) (store (select |v_#memory_$Pointer$#2.base_224| .cse0) .cse8 (select .cse4 .cse8)))) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= .cse0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |c_#valid| .cse11))))))) .cse3))))) (<= 0 .cse9) (= |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))) is different from false [2024-11-22 19:00:49,465 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse7 4))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse5 (+ .cse9 4)) (.cse3 (= (select |c_#valid| .cse0) 1))) (or (let ((.cse1 (select .cse4 .cse5))) (and (or (= .cse0 .cse1) (exists ((v_prenex_30 Int)) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_30 8))))) (exists ((v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select v_prenex_29 .cse1) 1))) .cse3)) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0) .cse5))) (and (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7) .cse0 (let ((.cse8 (+ 8 .cse9))) (store (select |v_#memory_$Pointer$#2.base_224| .cse0) .cse8 (select .cse4 .cse8)))) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= .cse0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |c_#valid| .cse11))))))) .cse3))))) (<= 0 .cse9) (= |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))) is different from true [2024-11-22 19:00:49,532 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 .cse0) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (select .cse8 4))) (let ((.cse3 (= (select |c_#valid| .cse2) 1)) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse6 (+ .cse0 4))) (or (let ((.cse1 (select .cse5 .cse6))) (and (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_30 8)) .cse2)) (= .cse1 .cse2)) .cse3 (exists ((v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse4 (select |c_#valid| .cse4)))) (= 1 (select v_prenex_29 .cse2)) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))))) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) .cse6))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7 (select |v_#memory_$Pointer$#2.base_224| .cse7)) |v_#memory_$Pointer$#2.base_224|) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse8) .cse2 (let ((.cse9 (+ .cse0 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse2) .cse9 (select .cse5 .cse9)))) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse2) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |c_#valid| .cse11)))) (= .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2024-11-22 19:00:49,535 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 .cse0) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (select .cse8 4))) (let ((.cse3 (= (select |c_#valid| .cse2) 1)) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse6 (+ .cse0 4))) (or (let ((.cse1 (select .cse5 .cse6))) (and (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_30 8)) .cse2)) (= .cse1 .cse2)) .cse3 (exists ((v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse4 (select |c_#valid| .cse4)))) (= 1 (select v_prenex_29 .cse2)) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))))) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) .cse6))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7 (select |v_#memory_$Pointer$#2.base_224| .cse7)) |v_#memory_$Pointer$#2.base_224|) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse8) .cse2 (let ((.cse9 (+ .cse0 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse2) .cse9 (select .cse5 .cse9)))) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse2) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |c_#valid| .cse11)))) (= .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from true [2024-11-22 19:00:49,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse1 (select .cse8 4))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse5 (+ 4 .cse10)) (.cse3 (= (select |c_#valid| .cse1) 1))) (or (let ((.cse0 (select .cse4 .cse5))) (and (or (= .cse0 .cse1) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ v_prenex_30 8)) .cse1))) (exists ((v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_29 .cse0) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) .cse3)) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) .cse5))) (and (= .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_#res#1.base| .cse8) .cse1 (let ((.cse9 (+ 8 .cse10))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse9 (select .cse4 .cse9)))) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |c_#valid| .cse11))))))) .cse3))))) (<= 0 .cse10))) is different from false [2024-11-22 19:00:49,666 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse1 (select .cse8 4))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse5 (+ 4 .cse10)) (.cse3 (= (select |c_#valid| .cse1) 1))) (or (let ((.cse0 (select .cse4 .cse5))) (and (or (= .cse0 .cse1) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ v_prenex_30 8)) .cse1))) (exists ((v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_29 .cse0) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) .cse3)) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) .cse5))) (and (= .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_#res#1.base| .cse8) .cse1 (let ((.cse9 (+ 8 .cse10))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse9 (select .cse4 .cse9)))) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |c_#valid| .cse11))))))) .cse3))))) (<= 0 .cse10))) is different from true [2024-11-22 19:00:49,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) 0) 0) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse4 (select .cse5 4))) (let ((.cse1 (= (select |c_#valid| .cse4) 1)) (.cse7 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse10 (+ .cse8 4))) (or (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4) .cse10))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2 (select |v_#memory_$Pointer$#2.base_224| .cse2)) |v_#memory_$Pointer$#2.base_224|) (= .cse2 .cse0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= .cse4 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= (store (store |v_#memory_$Pointer$#2.base_224| .cse0 .cse5) .cse4 (let ((.cse6 (+ .cse8 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse4) .cse6 (select .cse7 .cse6)))) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse9 (select |c_#valid| .cse9)))))))) (let ((.cse12 (select .cse7 .cse10))) (and .cse1 (exists ((v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse11 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse11 (select |c_#valid| .cse11)))) (= (select v_prenex_29 .cse0) 0) (= 1 (select v_prenex_29 .cse4)) (= (select v_prenex_29 .cse12) 1))) (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse12) (+ v_prenex_30 8)) .cse4)) (= .cse4 .cse12)))))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (<= 0 .cse8)))) is different from false [2024-11-22 19:00:49,747 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) 0) 0) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse4 (select .cse5 4))) (let ((.cse1 (= (select |c_#valid| .cse4) 1)) (.cse7 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse10 (+ .cse8 4))) (or (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4) .cse10))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2 (select |v_#memory_$Pointer$#2.base_224| .cse2)) |v_#memory_$Pointer$#2.base_224|) (= .cse2 .cse0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= .cse4 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= (store (store |v_#memory_$Pointer$#2.base_224| .cse0 .cse5) .cse4 (let ((.cse6 (+ .cse8 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse4) .cse6 (select .cse7 .cse6)))) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse9 (select |c_#valid| .cse9)))))))) (let ((.cse12 (select .cse7 .cse10))) (and .cse1 (exists ((v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse11 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse11 (select |c_#valid| .cse11)))) (= (select v_prenex_29 .cse0) 0) (= 1 (select v_prenex_29 .cse4)) (= (select v_prenex_29 .cse12) 1))) (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse12) (+ v_prenex_30 8)) .cse4)) (= .cse4 .cse12)))))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (<= 0 .cse8)))) is different from true [2024-11-22 19:00:49,771 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 368 treesize of output 304 [2024-11-22 19:00:49,789 INFO L349 Elim1Store]: treesize reduction 35, result has 28.6 percent of original size [2024-11-22 19:00:49,789 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 43 [2024-11-22 19:00:50,010 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse3 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse1 (select (select .cse6 .cse3) 4))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ v_arrayElimCell_196 4))) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0)))) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= .cse3 .cse4) (= v_DerPreprocessor_33 (let ((.cse5 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse5 (select (select .cse6 .cse1) .cse5))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse7 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7)))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse8) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= |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-11-22 19:00:50,014 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse3 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse1 (select (select .cse6 .cse3) 4))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ v_arrayElimCell_196 4))) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0)))) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= .cse3 .cse4) (= v_DerPreprocessor_33 (let ((.cse5 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse5 (select (select .cse6 .cse1) .cse5))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse7 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7)))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse8) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= |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-11-22 19:00:50,113 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse3 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse1 (select (select .cse6 .cse3) 4))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ v_arrayElimCell_196 4))) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0)))) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= .cse3 .cse4) (= v_DerPreprocessor_33 (let ((.cse5 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse5 (select (select .cse6 .cse1) .cse5))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse7 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7)))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse8) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |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-11-22 19:00:50,118 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse3 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse1 (select (select .cse6 .cse3) 4))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ v_arrayElimCell_196 4))) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0)))) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= .cse3 .cse4) (= v_DerPreprocessor_33 (let ((.cse5 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse5 (select (select .cse6 .cse1) .cse5))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse7 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7)))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse8) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |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-11-22 19:00:50,299 WARN L851 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse3 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse1 (select (select .cse6 .cse3) 4))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ v_arrayElimCell_196 4))) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0)))) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= .cse3 .cse4) (= v_DerPreprocessor_33 (let ((.cse5 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse5 (select (select .cse6 .cse1) .cse5))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse7 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7)))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse8) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-22 19:00:50,303 WARN L873 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse3 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse1 (select (select .cse6 .cse3) 4))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ v_arrayElimCell_196 4))) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0)))) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= .cse3 .cse4) (= v_DerPreprocessor_33 (let ((.cse5 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse5 (select (select .cse6 .cse1) .cse5))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse7 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7)))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse8) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-22 19:00:50,544 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse3 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse1 (select (select .cse6 .cse3) 4))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ v_arrayElimCell_196 4))) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0)))) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= .cse3 .cse4) (= v_DerPreprocessor_33 (let ((.cse5 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse5 (select (select .cse6 .cse1) .cse5))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse7 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7)))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse8) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1)))))))) is different from false [2024-11-22 19:00:50,547 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse3 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse1 (select (select .cse6 .cse3) 4))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ v_arrayElimCell_196 4))) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0)))) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= .cse3 .cse4) (= v_DerPreprocessor_33 (let ((.cse5 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse5 (select (select .cse6 .cse1) .cse5))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse7 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7)))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse8) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1)))))))) is different from true [2024-11-22 19:00:50,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:50,752 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 376 treesize of output 329 [2024-11-22 19:00:51,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:51,121 INFO L349 Elim1Store]: treesize reduction 64, result has 14.7 percent of original size [2024-11-22 19:00:51,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 91 [2024-11-22 19:00:51,726 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (and (let ((.cse9 (+ .cse4 4)) (.cse10 (select |c_#memory_$Pointer$#2.base| .cse0))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse3 (store (store |v_#memory_$Pointer$#2.base_224| .cse0 .cse10) v_DerPreprocessor_38 .cse5))) (let ((.cse1 (select (select .cse3 .cse0) 4))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse8 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) .cse9))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 0) (= (let ((.cse2 (+ .cse4 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse2 (select (select .cse3 .cse1) .cse2))) .cse5) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse6 (select |v_old(#valid)_AFTER_CALL_49| .cse6))) |v_old(#valid)_AFTER_CALL_49|) (= |c_#memory_$Pointer$#2.base| (store .cse3 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7 (select |v_#memory_$Pointer$#2.base_224| .cse7)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse1) (= .cse7 .cse0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) 1) (= v_DerPreprocessor_38 .cse1))))))) (let ((.cse12 (select .cse10 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse12) .cse9))) (and (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1) (= (let ((.cse11 (@diff v_prenex_29 |v_old(#valid)_AFTER_CALL_49|))) (store v_prenex_29 .cse11 (select |v_old(#valid)_AFTER_CALL_49| .cse11))) |v_old(#valid)_AFTER_CALL_49|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= 1 (select v_prenex_29 .cse12)) (= (select v_prenex_29 .cse13) 1))) (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse13) (+ v_prenex_30 8)) .cse12)) (= .cse12 .cse13))))))) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse20 (store (store |v_#memory_$Pointer$#2.base_224| .cse17 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse15 (select (select .cse20 .cse17) 4))) (let ((.cse16 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse15) (+ v_arrayElimCell_196 4))) (.cse18 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse14 (select |v_#valid_BEFORE_CALL_48| .cse14)))) (= .cse15 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse16) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse15) (= (select |v_old(#valid)_AFTER_CALL_48| .cse17) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse18 (select |v_#memory_$Pointer$#2.base_224| .cse18)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse15) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse16) 1) (= .cse17 .cse18) (= v_DerPreprocessor_33 (let ((.cse19 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse15) .cse19 (select (select .cse20 .cse15) .cse19))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse17) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse21 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse21 (select |v_#valid_BEFORE_CALL_48| .cse21)))) (= (select |v_#valid_BEFORE_CALL_48| .cse22) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse22) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (<= 0 .cse4)))) is different from false [2024-11-22 19:00:51,732 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (and (let ((.cse9 (+ .cse4 4)) (.cse10 (select |c_#memory_$Pointer$#2.base| .cse0))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse3 (store (store |v_#memory_$Pointer$#2.base_224| .cse0 .cse10) v_DerPreprocessor_38 .cse5))) (let ((.cse1 (select (select .cse3 .cse0) 4))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse8 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) .cse9))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 0) (= (let ((.cse2 (+ .cse4 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse2 (select (select .cse3 .cse1) .cse2))) .cse5) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse6 (select |v_old(#valid)_AFTER_CALL_49| .cse6))) |v_old(#valid)_AFTER_CALL_49|) (= |c_#memory_$Pointer$#2.base| (store .cse3 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7 (select |v_#memory_$Pointer$#2.base_224| .cse7)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse1) (= .cse7 .cse0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) 1) (= v_DerPreprocessor_38 .cse1))))))) (let ((.cse12 (select .cse10 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse12) .cse9))) (and (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1) (= (let ((.cse11 (@diff v_prenex_29 |v_old(#valid)_AFTER_CALL_49|))) (store v_prenex_29 .cse11 (select |v_old(#valid)_AFTER_CALL_49| .cse11))) |v_old(#valid)_AFTER_CALL_49|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= 1 (select v_prenex_29 .cse12)) (= (select v_prenex_29 .cse13) 1))) (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse13) (+ v_prenex_30 8)) .cse12)) (= .cse12 .cse13))))))) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse20 (store (store |v_#memory_$Pointer$#2.base_224| .cse17 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse15 (select (select .cse20 .cse17) 4))) (let ((.cse16 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse15) (+ v_arrayElimCell_196 4))) (.cse18 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse14 (select |v_#valid_BEFORE_CALL_48| .cse14)))) (= .cse15 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse16) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse15) (= (select |v_old(#valid)_AFTER_CALL_48| .cse17) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse18 (select |v_#memory_$Pointer$#2.base_224| .cse18)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse15) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse16) 1) (= .cse17 .cse18) (= v_DerPreprocessor_33 (let ((.cse19 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse15) .cse19 (select (select .cse20 .cse15) .cse19))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse17) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse21 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse21 (select |v_#valid_BEFORE_CALL_48| .cse21)))) (= (select |v_#valid_BEFORE_CALL_48| .cse22) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse22) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (<= 0 .cse4)))) is different from true [2024-11-22 19:00:52,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:52,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 845 treesize of output 609 [2024-11-22 19:00:52,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:52,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 237 [2024-11-22 19:00:52,728 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (and (let ((.cse3 (+ .cse9 4)) (.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (or (let ((.cse0 (select .cse4 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse3))) (and (or (= .cse0 .cse1) (exists ((v_prenex_30 Int)) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_30 8))))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select v_prenex_29 .cse0) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (let ((.cse2 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse2 (select v_prenex_33 .cse2))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0)))))) (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse8 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse4) v_DerPreprocessor_38 .cse5))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6) .cse3)) (.cse12 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= .cse5 (let ((.cse7 (+ 8 .cse9))) (store (select |v_#memory_$Pointer$#2.base_224| .cse6) .cse7 (select (select .cse8 .cse6) .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |v_old(#valid)_AFTER_CALL_49| .cse11))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse12 (select |v_#memory_$Pointer$#2.base_224| .cse12)) |v_#memory_$Pointer$#2.base_224|) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse6) (= .cse6 v_DerPreprocessor_38) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= |c_#memory_$Pointer$#2.base| (store .cse8 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= .cse12 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1))))))))) (<= 0 .cse9) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0))) is different from false [2024-11-22 19:00:52,732 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (and (let ((.cse3 (+ .cse9 4)) (.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (or (let ((.cse0 (select .cse4 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse3))) (and (or (= .cse0 .cse1) (exists ((v_prenex_30 Int)) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_30 8))))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select v_prenex_29 .cse0) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (let ((.cse2 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse2 (select v_prenex_33 .cse2))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0)))))) (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse8 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse4) v_DerPreprocessor_38 .cse5))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6) .cse3)) (.cse12 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= .cse5 (let ((.cse7 (+ 8 .cse9))) (store (select |v_#memory_$Pointer$#2.base_224| .cse6) .cse7 (select (select .cse8 .cse6) .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |v_old(#valid)_AFTER_CALL_49| .cse11))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse12 (select |v_#memory_$Pointer$#2.base_224| .cse12)) |v_#memory_$Pointer$#2.base_224|) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse6) (= .cse6 v_DerPreprocessor_38) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= |c_#memory_$Pointer$#2.base| (store .cse8 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= .cse12 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1))))))))) (<= 0 .cse9) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0))) is different from true [2024-11-22 19:00:52,827 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (and (let ((.cse8 (+ 4 .cse5)) (.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse1 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse9) v_DerPreprocessor_38 .cse6))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0) .cse8))) (and (= v_DerPreprocessor_38 .cse0) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store .cse1 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse2 (select |v_old(#valid)_AFTER_CALL_49| .cse2))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3 (select |v_#memory_$Pointer$#2.base_224| .cse3)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (let ((.cse4 (+ 8 .cse5))) (store (select |v_#memory_$Pointer$#2.base_224| .cse0) .cse4 (select (select .cse1 .cse0) .cse4))) .cse6) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse0) (= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0))))))) (let ((.cse12 (select .cse9 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse12) .cse8))) (and (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse10 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse10 (select v_prenex_33 .cse10))) v_prenex_33) (= (select v_prenex_29 .cse11) 1) (= (select v_prenex_29 .cse12) 1) (= (select v_prenex_33 v_prenex_32) 0))) (or (= .cse11 .cse12) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse11) (+ v_prenex_30 8)) .cse12)))))))) (<= 0 .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) is different from false [2024-11-22 19:00:52,831 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (and (let ((.cse8 (+ 4 .cse5)) (.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse1 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse9) v_DerPreprocessor_38 .cse6))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0) .cse8))) (and (= v_DerPreprocessor_38 .cse0) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store .cse1 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse2 (select |v_old(#valid)_AFTER_CALL_49| .cse2))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3 (select |v_#memory_$Pointer$#2.base_224| .cse3)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (let ((.cse4 (+ 8 .cse5))) (store (select |v_#memory_$Pointer$#2.base_224| .cse0) .cse4 (select (select .cse1 .cse0) .cse4))) .cse6) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse0) (= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0))))))) (let ((.cse12 (select .cse9 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse12) .cse8))) (and (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse10 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse10 (select v_prenex_33 .cse10))) v_prenex_33) (= (select v_prenex_29 .cse11) 1) (= (select v_prenex_29 .cse12) 1) (= (select v_prenex_33 v_prenex_32) 0))) (or (= .cse11 .cse12) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse11) (+ v_prenex_30 8)) .cse12)))))))) (<= 0 .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) is different from true [2024-11-22 19:00:53,010 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (let ((.cse8 (+ 4 .cse5)) (.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse1 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse9) v_DerPreprocessor_38 .cse6))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0) .cse8))) (and (= v_DerPreprocessor_38 .cse0) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store .cse1 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse2 (select |v_old(#valid)_AFTER_CALL_49| .cse2))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3 (select |v_#memory_$Pointer$#2.base_224| .cse3)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (let ((.cse4 (+ 8 .cse5))) (store (select |v_#memory_$Pointer$#2.base_224| .cse0) .cse4 (select (select .cse1 .cse0) .cse4))) .cse6) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse0) (= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0))))))) (let ((.cse12 (select .cse9 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse12) .cse8))) (and (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse10 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse10 (select v_prenex_33 .cse10))) v_prenex_33) (= (select v_prenex_29 .cse11) 1) (= (select v_prenex_29 .cse12) 1) (= (select v_prenex_33 v_prenex_32) 0))) (or (= .cse11 .cse12) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse11) (+ v_prenex_30 8)) .cse12)))))))) (<= 0 .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) is different from false [2024-11-22 19:00:53,017 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (let ((.cse8 (+ 4 .cse5)) (.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse1 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse9) v_DerPreprocessor_38 .cse6))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0) .cse8))) (and (= v_DerPreprocessor_38 .cse0) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store .cse1 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse2 (select |v_old(#valid)_AFTER_CALL_49| .cse2))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3 (select |v_#memory_$Pointer$#2.base_224| .cse3)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (let ((.cse4 (+ 8 .cse5))) (store (select |v_#memory_$Pointer$#2.base_224| .cse0) .cse4 (select (select .cse1 .cse0) .cse4))) .cse6) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse0) (= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0))))))) (let ((.cse12 (select .cse9 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse12) .cse8))) (and (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse10 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse10 (select v_prenex_33 .cse10))) v_prenex_33) (= (select v_prenex_29 .cse11) 1) (= (select v_prenex_29 .cse12) 1) (= (select v_prenex_33 v_prenex_32) 0))) (or (= .cse11 .cse12) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse11) (+ v_prenex_30 8)) .cse12)))))))) (<= 0 .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) is different from true [2024-11-22 19:00:53,126 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 372 treesize of output 336 [2024-11-22 19:00:53,388 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 4))) (or (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse3))) (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse1) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_29 .cse2) 1) (exists ((v_prenex_30 Int)) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_30 8)))))))))) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse9 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse9)) (.cse7 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse9 .cse11) v_DerPreprocessor_38 .cse7))) (let ((.cse4 (select (select .cse6 .cse9) 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4) .cse3))) (and (= v_DerPreprocessor_38 .cse4) (= (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse4) .cse5 (select (select .cse6 .cse4) .cse5))) .cse7) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse8 (select |v_old(#valid)_AFTER_CALL_49| .cse8))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse9 (select |v_#memory_$Pointer$#2.base_224| .cse9)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (store .cse6 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_48| .cse4)) (= (select |v_old(#valid)_AFTER_CALL_49| .cse9) 1) (= (select .cse11 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|)))))))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 v_prenex_32) 0) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse12 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse12 (select v_prenex_33 .cse12))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse13) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse13) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse13) .cse3) .cse13)))))))))) (<= 0 |c_ULTIMATE.start_dll_append_#t~mem11#1.offset|)) is different from false [2024-11-22 19:00:53,392 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 4))) (or (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse3))) (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse1) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_29 .cse2) 1) (exists ((v_prenex_30 Int)) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_30 8)))))))))) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse9 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse9)) (.cse7 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse9 .cse11) v_DerPreprocessor_38 .cse7))) (let ((.cse4 (select (select .cse6 .cse9) 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4) .cse3))) (and (= v_DerPreprocessor_38 .cse4) (= (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse4) .cse5 (select (select .cse6 .cse4) .cse5))) .cse7) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse8 (select |v_old(#valid)_AFTER_CALL_49| .cse8))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse9 (select |v_#memory_$Pointer$#2.base_224| .cse9)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (store .cse6 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_48| .cse4)) (= (select |v_old(#valid)_AFTER_CALL_49| .cse9) 1) (= (select .cse11 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|)))))))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 v_prenex_32) 0) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse12 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse12 (select v_prenex_33 .cse12))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse13) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse13) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse13) .cse3) .cse13)))))))))) (<= 0 |c_ULTIMATE.start_dll_append_#t~mem11#1.offset|)) is different from true [2024-11-22 19:00:53,541 WARN L851 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (let ((.cse3 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (and (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_30 8)) .cse2)) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse2) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= (select v_prenex_29 .cse1) 1))))))) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse4 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse4 (select v_prenex_33 .cse4))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (and (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse3) .cse5) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse5) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)))))) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse12 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse9 (store (store |v_#memory_$Pointer$#2.base_224| .cse8 .cse11) v_DerPreprocessor_38 .cse12))) (let ((.cse6 (select (select .cse9 .cse8) 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6) .cse3))) (and (= v_DerPreprocessor_38 .cse6) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse7 (select |v_old(#valid)_AFTER_CALL_49| .cse7))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse8 (select |v_#memory_$Pointer$#2.base_224| .cse8)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (store .cse9 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse6) (= 1 (select |v_old(#valid)_AFTER_CALL_48| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select .cse11 4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_49| .cse8) 1) (= .cse12 (let ((.cse13 (+ 8 |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (store (select |v_#memory_$Pointer$#2.base_224| .cse6) .cse13 (select (select .cse9 .cse6) .cse13)))))))))))))) is different from false [2024-11-22 19:00:53,545 WARN L873 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (let ((.cse3 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (and (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_30 8)) .cse2)) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse2) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= (select v_prenex_29 .cse1) 1))))))) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse4 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse4 (select v_prenex_33 .cse4))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (and (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse3) .cse5) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse5) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)))))) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse12 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse9 (store (store |v_#memory_$Pointer$#2.base_224| .cse8 .cse11) v_DerPreprocessor_38 .cse12))) (let ((.cse6 (select (select .cse9 .cse8) 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6) .cse3))) (and (= v_DerPreprocessor_38 .cse6) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse7 (select |v_old(#valid)_AFTER_CALL_49| .cse7))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse8 (select |v_#memory_$Pointer$#2.base_224| .cse8)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (store .cse9 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse6) (= 1 (select |v_old(#valid)_AFTER_CALL_48| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select .cse11 4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_49| .cse8) 1) (= .cse12 (let ((.cse13 (+ 8 |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (store (select |v_#memory_$Pointer$#2.base_224| .cse6) .cse13 (select (select .cse9 .cse6) .cse13)))))))))))))) is different from true [2024-11-22 19:00:53,858 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 19:00:53,858 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 40 treesize of output 15 [2024-11-22 19:00:53,880 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-22 19:00:53,880 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 23 [2024-11-22 19:00:54,030 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_214 Int) (v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 v_arrayElimCell_214) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_48| Int)) (and (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_48|) (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse4 (store (store (store |v_#memory_$Pointer$#2.base_224| .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) |node_create_~temp~0#1.base| v_DerPreprocessor_43))) (let ((.cse5 (select .cse4 .cse2)) (.cse9 (select .cse4 v_DerPreprocessor_38))) (let ((.cse8 (store (store |v_#memory_$Pointer$#2.base_224| .cse2 .cse5) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse8 .cse2) 4)) (.cse6 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse6))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_old(#valid)_AFTER_CALL_49| .cse1))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2 (select |v_#memory_$Pointer$#2.base_224| .cse2)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= v_DerPreprocessor_38 .cse3) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select (select .cse4 (select .cse5 4)) .cse6)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 0) (= (let ((.cse7 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse8 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))))))))))))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (let ((.cse11 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse11 (select v_prenex_33 .cse11))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0)))) is different from false [2024-11-22 19:00:58,247 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_214 Int) (v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 v_arrayElimCell_214) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_48| Int)) (and (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_48|) (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse4 (store (store (store |v_#memory_$Pointer$#2.base_224| .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) |node_create_~temp~0#1.base| v_DerPreprocessor_43))) (let ((.cse5 (select .cse4 .cse2)) (.cse9 (select .cse4 v_DerPreprocessor_38))) (let ((.cse8 (store (store |v_#memory_$Pointer$#2.base_224| .cse2 .cse5) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse8 .cse2) 4)) (.cse6 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse6))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_old(#valid)_AFTER_CALL_49| .cse1))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2 (select |v_#memory_$Pointer$#2.base_224| .cse2)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= v_DerPreprocessor_38 .cse3) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select (select .cse4 (select .cse5 4)) .cse6)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 0) (= (let ((.cse7 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse8 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))))))))))))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (let ((.cse11 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse11 (select v_prenex_33 .cse11))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0)))) is different from true [2024-11-22 19:00:58,523 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= 1 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_48| Int)) (and (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse4 (store (store (store |v_#memory_$Pointer$#2.base_224| .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) |node_create_~temp~0#1.base| v_DerPreprocessor_43))) (let ((.cse5 (select .cse4 .cse2)) (.cse9 (select .cse4 v_DerPreprocessor_38))) (let ((.cse8 (store (store |v_#memory_$Pointer$#2.base_224| .cse2 .cse5) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse8 .cse2) 4)) (.cse6 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse6))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_old(#valid)_AFTER_CALL_49| .cse1))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2 (select |v_#memory_$Pointer$#2.base_224| .cse2)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= v_DerPreprocessor_38 .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse4 (select .cse5 4)) .cse6)) (= (let ((.cse7 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse8 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))))))))))) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_48|))) (exists ((v_arrayElimCell_214 Int) (v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 v_arrayElimCell_214) 1) (= 1 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse11 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse11 (select v_prenex_33 .cse11))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0)))) is different from false [2024-11-22 19:01:03,919 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= 1 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_48| Int)) (and (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse4 (store (store (store |v_#memory_$Pointer$#2.base_224| .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) |node_create_~temp~0#1.base| v_DerPreprocessor_43))) (let ((.cse5 (select .cse4 .cse2)) (.cse9 (select .cse4 v_DerPreprocessor_38))) (let ((.cse8 (store (store |v_#memory_$Pointer$#2.base_224| .cse2 .cse5) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse8 .cse2) 4)) (.cse6 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse6))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_old(#valid)_AFTER_CALL_49| .cse1))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2 (select |v_#memory_$Pointer$#2.base_224| .cse2)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= v_DerPreprocessor_38 .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse4 (select .cse5 4)) .cse6)) (= (let ((.cse7 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse8 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))))))))))) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_48|))) (exists ((v_arrayElimCell_214 Int) (v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 v_arrayElimCell_214) 1) (= 1 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse11 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse11 (select v_prenex_33 .cse11))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0)))) is different from true [2024-11-22 19:01:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 35 not checked. [2024-11-22 19:01:03,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:01:04,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049653438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:01:04,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:01:04,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 61 [2024-11-22 19:01:04,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650534990] [2024-11-22 19:01:04,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 19:01:04,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-22 19:01:04,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:01:04,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-22 19:01:04,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2218, Unknown=40, NotChecked=2260, Total=4692 [2024-11-22 19:01:04,527 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand has 62 states, 59 states have (on average 2.0338983050847457) internal successors, (120), 55 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-22 19:01:05,879 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse4 (select .cse9 .cse2)) (.cse8 (select .cse9 4))) (let ((.cse7 (= (select |c_#valid| .cse8) 1)) (.cse6 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_#memory_$Pointer$#2.base|)) (.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= .cse0 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse3 (select |c_#valid| .cse3)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |c_#valid| .cse5)))))) .cse6)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) .cse7 (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) (or .cse7 (= .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| .cse4) 1) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|) .cse6 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))) is different from false [2024-11-22 19:01:05,883 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse4 (select .cse9 .cse2)) (.cse8 (select .cse9 4))) (let ((.cse7 (= (select |c_#valid| .cse8) 1)) (.cse6 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_#memory_$Pointer$#2.base|)) (.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= .cse0 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse3 (select |c_#valid| .cse3)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |c_#valid| .cse5)))))) .cse6)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) .cse7 (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) (or .cse7 (= .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| .cse4) 1) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|) .cse6 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))) is different from true [2024-11-22 19:01:05,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (or (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_#memory_$Pointer$#2.base|)) (.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse3 (select |c_#valid| .cse3)))))) (let ((.cse4 (select .cse6 .cse2))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |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 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse7 (select .cse6 4))) (or (= (select |c_#valid| .cse7) 1) (= .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from false [2024-11-22 19:01:05,894 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (or (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_#memory_$Pointer$#2.base|)) (.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse3 (select |c_#valid| .cse3)))))) (let ((.cse4 (select .cse6 .cse2))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |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 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse7 (select .cse6 4))) (or (= (select |c_#valid| .cse7) 1) (= .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from true [2024-11-22 19:01:05,903 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |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 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (or (let ((.cse0 (select .cse2 .cse3))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int)))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3))) (and (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse6 (select |c_#valid| .cse6)))))) (= (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_$Pointer$#2.base|))))) (let ((.cse7 (select .cse2 4))) (or (= (select |c_#valid| .cse7) 1) (= .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from false [2024-11-22 19:01:05,907 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |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 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (or (let ((.cse0 (select .cse2 .cse3))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int)))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3))) (and (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse6 (select |c_#valid| .cse6)))))) (= (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_$Pointer$#2.base|))))) (let ((.cse7 (select .cse2 4))) (or (= (select |c_#valid| .cse7) 1) (= .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from true [2024-11-22 19:01:05,914 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse1 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse7 (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (and (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse3 (not (= .cse6 0))) (.cse2 (select .cse5 4))) (or (and (= (select |c_#valid| .cse2) 1) .cse3) (and .cse3 (= .cse4 .cse2)))) .cse7 (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (or (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse9 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6))) (and (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) |c_#memory_$Pointer$#2.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse8 (select |v_#memory_$Pointer$#2.base_224| .cse8)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse9) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#valid| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse10 (select |c_#valid| .cse10))))))) .cse7) (let ((.cse11 (select .cse5 .cse6))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse11) 1) (= |c_#valid| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse12 (select |c_#valid| .cse12)))))) .cse7 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse11) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))) is different from false [2024-11-22 19:01:05,918 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse1 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse7 (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (and (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse3 (not (= .cse6 0))) (.cse2 (select .cse5 4))) (or (and (= (select |c_#valid| .cse2) 1) .cse3) (and .cse3 (= .cse4 .cse2)))) .cse7 (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (or (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse9 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6))) (and (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) |c_#memory_$Pointer$#2.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse8 (select |v_#memory_$Pointer$#2.base_224| .cse8)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse9) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#valid| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse10 (select |c_#valid| .cse10))))))) .cse7) (let ((.cse11 (select .cse5 .cse6))) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse11) 1) (= |c_#valid| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse12 (select |c_#valid| .cse12)))))) .cse7 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse11) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))) is different from true [2024-11-22 19:01:05,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse7 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse12 (select .cse7 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (.cse4 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse3 (= (select |c_#valid| .cse0) 1))) (and (let ((.cse5 (+ .cse9 4))) (or (let ((.cse1 (select .cse4 .cse5))) (and (or (= .cse0 .cse1) (exists ((v_prenex_30 Int)) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_30 8))))) (exists ((v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select v_prenex_29 .cse1) 1))) .cse3)) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0) .cse5))) (and (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7) .cse0 (let ((.cse8 (+ 8 .cse9))) (store (select |v_#memory_$Pointer$#2.base_224| .cse0) .cse8 (select .cse4 .cse8)))) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= .cse0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |c_#valid| .cse11))))))) .cse3))) (<= 0 .cse9) (= .cse9 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| .cse12) 1) (= (select |c_#valid| (select .cse4 4)) 1) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) .cse3)))) is different from false [2024-11-22 19:01:05,936 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse7 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse12 (select .cse7 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (.cse4 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse3 (= (select |c_#valid| .cse0) 1))) (and (let ((.cse5 (+ .cse9 4))) (or (let ((.cse1 (select .cse4 .cse5))) (and (or (= .cse0 .cse1) (exists ((v_prenex_30 Int)) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_30 8))))) (exists ((v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select v_prenex_29 .cse1) 1))) .cse3)) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse0) .cse5))) (and (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7) .cse0 (let ((.cse8 (+ 8 .cse9))) (store (select |v_#memory_$Pointer$#2.base_224| .cse0) .cse8 (select .cse4 .cse8)))) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= .cse0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |c_#valid| .cse11))))))) .cse3))) (<= 0 .cse9) (= .cse9 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| .cse12) 1) (= (select |c_#valid| (select .cse4 4)) 1) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) .cse3)))) is different from true [2024-11-22 19:01:05,947 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse5 (select .cse9 4))) (let ((.cse0 (= (select |c_#valid| .cse5) 1)) (.cse2 (select |c_#memory_$Pointer$#2.base| .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (select .cse9 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (= .cse1 0) (<= 0 .cse1) (= (select |c_#valid| (select .cse2 4)) 1) (= (select |c_#valid| .cse3) 1) (let ((.cse7 (+ .cse1 4))) (or (let ((.cse4 (select .cse2 .cse7))) (and (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) (+ v_prenex_30 8)) .cse5)) (= .cse4 .cse5)) .cse0 (exists ((v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse4) 1) (= |c_#valid| (let ((.cse6 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse6 (select |c_#valid| .cse6)))) (= 1 (select v_prenex_29 .cse5)) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse11 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse5) .cse7))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse8 (select |v_#memory_$Pointer$#2.base_224| .cse8)) |v_#memory_$Pointer$#2.base_224|) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse9) .cse5 (let ((.cse10 (+ .cse1 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse5) .cse10 (select .cse2 .cse10)))) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse11) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse5) (= |c_#valid| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse12 (select |c_#valid| .cse12)))) (= .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse11) 1))))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))) is different from false [2024-11-22 19:01:05,951 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse5 (select .cse9 4))) (let ((.cse0 (= (select |c_#valid| .cse5) 1)) (.cse2 (select |c_#memory_$Pointer$#2.base| .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (select .cse9 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (= .cse1 0) (<= 0 .cse1) (= (select |c_#valid| (select .cse2 4)) 1) (= (select |c_#valid| .cse3) 1) (let ((.cse7 (+ .cse1 4))) (or (let ((.cse4 (select .cse2 .cse7))) (and (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) (+ v_prenex_30 8)) .cse5)) (= .cse4 .cse5)) .cse0 (exists ((v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse4) 1) (= |c_#valid| (let ((.cse6 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse6 (select |c_#valid| .cse6)))) (= 1 (select v_prenex_29 .cse5)) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse11 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse5) .cse7))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse8 (select |v_#memory_$Pointer$#2.base_224| .cse8)) |v_#memory_$Pointer$#2.base_224|) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse9) .cse5 (let ((.cse10 (+ .cse1 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse5) .cse10 (select .cse2 .cse10)))) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse11) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse5) (= |c_#valid| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse12 (select |c_#valid| .cse12)))) (= .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse11) 1))))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))) is different from true [2024-11-22 19:01:05,961 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse4 (select .cse8 4))) (let ((.cse0 (= (select |c_#valid| .cse4) 1)) (.cse2 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (= .cse1 0) (<= 0 .cse1) (= (select |c_#valid| (select .cse2 4)) 1) (let ((.cse6 (+ .cse1 4))) (or (let ((.cse3 (select .cse2 .cse6))) (and (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) (+ v_prenex_30 8)) .cse4)) (= .cse3 .cse4)) .cse0 (exists ((v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse3) 1) (= |c_#valid| (let ((.cse5 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse5 (select |c_#valid| .cse5)))) (= 1 (select v_prenex_29 .cse4)) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4) .cse6))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7 (select |v_#memory_$Pointer$#2.base_224| .cse7)) |v_#memory_$Pointer$#2.base_224|) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse8) .cse4 (let ((.cse9 (+ .cse1 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse4) .cse9 (select .cse2 .cse9)))) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse4) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |c_#valid| .cse11)))) (= .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))) is different from false [2024-11-22 19:01:05,966 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse4 (select .cse8 4))) (let ((.cse0 (= (select |c_#valid| .cse4) 1)) (.cse2 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (= .cse1 0) (<= 0 .cse1) (= (select |c_#valid| (select .cse2 4)) 1) (let ((.cse6 (+ .cse1 4))) (or (let ((.cse3 (select .cse2 .cse6))) (and (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) (+ v_prenex_30 8)) .cse4)) (= .cse3 .cse4)) .cse0 (exists ((v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse3) 1) (= |c_#valid| (let ((.cse5 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse5 (select |c_#valid| .cse5)))) (= 1 (select v_prenex_29 .cse4)) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4) .cse6))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7 (select |v_#memory_$Pointer$#2.base_224| .cse7)) |v_#memory_$Pointer$#2.base_224|) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse8) .cse4 (let ((.cse9 (+ .cse1 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse4) .cse9 (select .cse2 .cse9)))) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse4) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |c_#valid| .cse11)))) (= .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))) is different from true [2024-11-22 19:01:05,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse3 (select .cse8 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse1 (= (select |c_#valid| .cse3) 1)) (.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| (select .cse0 4)) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (let ((.cse5 (+ 4 .cse10))) (or (let ((.cse2 (select .cse0 .cse5))) (and (or (= .cse2 .cse3) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_30 8)) .cse3))) (exists ((v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_29 .cse3) 1) (= (select v_prenex_29 .cse2) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) .cse1)) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse5))) (and (= .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_#res#1.base| .cse8) .cse3 (let ((.cse9 (+ 8 .cse10))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse9 (select .cse0 .cse9)))) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |c_#valid| .cse11))))))) .cse1))) (<= 0 .cse10) (= 0 .cse10))))) is different from false [2024-11-22 19:01:05,982 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse3 (select .cse8 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse1 (= (select |c_#valid| .cse3) 1)) (.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| (select .cse0 4)) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (let ((.cse5 (+ 4 .cse10))) (or (let ((.cse2 (select .cse0 .cse5))) (and (or (= .cse2 .cse3) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_30 8)) .cse3))) (exists ((v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_29 .cse3) 1) (= (select v_prenex_29 .cse2) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) .cse1)) (and (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse5))) (and (= .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_create_#res#1.base| .cse8) .cse3 (let ((.cse9 (+ 8 .cse10))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse9 (select .cse0 .cse9)))) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |c_#valid| .cse11))))))) .cse1))) (<= 0 .cse10) (= 0 .cse10))))) is different from true [2024-11-22 19:01:05,994 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse0 (select .cse16 0)) (.cse1 (select .cse16 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select .cse2 0) 0) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) 1) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse7 (select .cse8 4))) (let ((.cse4 (= (select |c_#valid| .cse7) 1)) (.cse10 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse13 (+ .cse11 4))) (or (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7) .cse13))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse5 (select |v_#memory_$Pointer$#2.base_224| .cse5)) |v_#memory_$Pointer$#2.base_224|) (= .cse5 .cse0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) 1) (= .cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= (store (store |v_#memory_$Pointer$#2.base_224| .cse0 .cse8) .cse7 (let ((.cse9 (+ .cse11 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse7) .cse9 (select .cse10 .cse9)))) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse12 (select |c_#valid| .cse12)))))))) (let ((.cse15 (select .cse10 .cse13))) (and .cse4 (exists ((v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse14 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse14 (select |c_#valid| .cse14)))) (= (select v_prenex_29 .cse0) 0) (= 1 (select v_prenex_29 .cse7)) (= (select v_prenex_29 .cse15) 1))) (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse15) (+ v_prenex_30 8)) .cse7)) (= .cse7 .cse15)))))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (<= 0 .cse11))))) is different from false [2024-11-22 19:01:05,998 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse0 (select .cse16 0)) (.cse1 (select .cse16 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select .cse2 0) 0) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) 1) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse7 (select .cse8 4))) (let ((.cse4 (= (select |c_#valid| .cse7) 1)) (.cse10 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse13 (+ .cse11 4))) (or (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7) .cse13))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse5 (select |v_#memory_$Pointer$#2.base_224| .cse5)) |v_#memory_$Pointer$#2.base_224|) (= .cse5 .cse0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) 1) (= .cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= (store (store |v_#memory_$Pointer$#2.base_224| .cse0 .cse8) .cse7 (let ((.cse9 (+ .cse11 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse7) .cse9 (select .cse10 .cse9)))) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_48| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_48| .cse12 (select |c_#valid| .cse12)))))))) (let ((.cse15 (select .cse10 .cse13))) (and .cse4 (exists ((v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse14 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse14 (select |c_#valid| .cse14)))) (= (select v_prenex_29 .cse0) 0) (= 1 (select v_prenex_29 .cse7)) (= (select v_prenex_29 .cse15) 1))) (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse15) (+ v_prenex_30 8)) .cse7)) (= .cse7 .cse15)))))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (<= 0 .cse11))))) is different from true [2024-11-22 19:01:06,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse7 (store (store |v_#memory_$Pointer$#2.base_224| .cse4 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse2 (select (select .cse7 .cse4) 4))) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ v_arrayElimCell_196 4))) (.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_#valid_BEFORE_CALL_48| .cse1)))) (= .cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse2) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse5 (select |v_#memory_$Pointer$#2.base_224| .cse5)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= .cse4 .cse5) (= v_DerPreprocessor_33 (let ((.cse6 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse2) .cse6 (select (select .cse7 .cse2) .cse6))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse4) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse8 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse8 (select |v_#valid_BEFORE_CALL_48| .cse8)))) (= (select |v_#valid_BEFORE_CALL_48| .cse9) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse9) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse0 1) (= (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-11-22 19:01:06,023 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse7 (store (store |v_#memory_$Pointer$#2.base_224| .cse4 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse2 (select (select .cse7 .cse4) 4))) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ v_arrayElimCell_196 4))) (.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_#valid_BEFORE_CALL_48| .cse1)))) (= .cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse2) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse5 (select |v_#memory_$Pointer$#2.base_224| .cse5)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= .cse4 .cse5) (= v_DerPreprocessor_33 (let ((.cse6 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse2) .cse6 (select (select .cse7 .cse2) .cse6))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse4) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse8 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse8 (select |v_#valid_BEFORE_CALL_48| .cse8)))) (= (select |v_#valid_BEFORE_CALL_48| .cse9) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse9) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse0 1) (= (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-11-22 19:01:06,039 WARN L851 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse3 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse1 (select (select .cse6 .cse3) 4))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ v_arrayElimCell_196 4))) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0)))) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= .cse3 .cse4) (= v_DerPreprocessor_33 (let ((.cse5 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse5 (select (select .cse6 .cse1) .cse5))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse7 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7)))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse8) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-22 19:01:06,044 WARN L873 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse3 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse1 (select (select .cse6 .cse3) 4))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ v_arrayElimCell_196 4))) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0)))) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= .cse3 .cse4) (= v_DerPreprocessor_33 (let ((.cse5 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse5 (select (select .cse6 .cse1) .cse5))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse7 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7)))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse8) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-22 19:01:06,059 WARN L851 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse3 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse1 (select (select .cse6 .cse3) 4))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ v_arrayElimCell_196 4))) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0)))) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= .cse3 .cse4) (= v_DerPreprocessor_33 (let ((.cse5 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse5 (select (select .cse6 .cse1) .cse5))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse7 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7)))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse8) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-22 19:01:06,065 WARN L873 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse3 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse1 (select (select .cse6 .cse3) 4))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) (+ v_arrayElimCell_196 4))) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0)))) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4 (select |v_#memory_$Pointer$#2.base_224| .cse4)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= .cse3 .cse4) (= v_DerPreprocessor_33 (let ((.cse5 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse5 (select (select .cse6 .cse1) .cse5))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse7 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7)))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse8) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-22 19:01:06,317 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse20 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (.cse4 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|))) (let ((.cse6 (store |c_old(#memory_$Pointer$#2.offset)| .cse4 (select |c_#memory_$Pointer$#2.offset| .cse4))) (.cse3 (store |c_old(#memory_$Pointer$#2.base)| .cse20 (select |c_#memory_$Pointer$#2.base| .cse20)))) (let ((.cse2 (@diff .cse3 |c_#memory_$Pointer$#2.base|)) (.cse5 (@diff .cse6 |c_#memory_$Pointer$#2.offset|))) (let ((.cse19 (@diff |c_old(#valid)| |c_#valid|)) (.cse8 (store .cse6 .cse5 (select |c_#memory_$Pointer$#2.offset| .cse5))) (.cse0 (store .cse3 .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)))) (let ((.cse1 (@diff .cse0 |c_#memory_$Pointer$#2.base|)) (.cse9 (@diff .cse8 |c_#memory_$Pointer$#2.offset|)) (.cse7 (select |c_#valid| .cse19))) (and (= (store .cse0 .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse2) 0) (= .cse3 |c_#memory_$Pointer$#2.base|)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (or (= (select |c_old(#valid)| .cse4) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (or (= 0 (select |c_old(#valid)| .cse5)) (= .cse6 |c_#memory_$Pointer$#2.offset|)) (or (= (select |c_old(#valid)| .cse1) 0) (= .cse0 |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (or (= |c_#valid| |c_old(#valid)|) (= .cse7 1)) (= |c_#memory_$Pointer$#2.offset| (store .cse8 .cse9 (select |c_#memory_$Pointer$#2.offset| .cse9))) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse16 (store (store |v_#memory_$Pointer$#2.base_224| .cse13 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse11 (select (select .cse16 .cse13) 4))) (let ((.cse12 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse11) (+ v_arrayElimCell_196 4))) (.cse14 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse10 (select |v_#valid_BEFORE_CALL_48| .cse10)))) (= .cse11 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse11) (= (select |v_old(#valid)_AFTER_CALL_48| .cse13) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse14 (select |v_#memory_$Pointer$#2.base_224| .cse14)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse12) 1) (= .cse13 .cse14) (= v_DerPreprocessor_33 (let ((.cse15 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse11) .cse15 (select (select .cse16 .cse11) .cse15))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse13) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse18 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse17 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse17 (select |v_#valid_BEFORE_CALL_48| .cse17)))) (= (select |v_#valid_BEFORE_CALL_48| .cse18) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse18) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (or (= .cse8 |c_#memory_$Pointer$#2.offset|) (= (select |c_old(#valid)| .cse9) 0)) (= |c_#valid| (store |c_old(#valid)| .cse19 .cse7)) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse20) 0)) (<= 0 |c_node_create_#res#1.offset|))))))) is different from false [2024-11-22 19:01:07,084 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse20 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (.cse4 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|))) (let ((.cse6 (store |c_old(#memory_$Pointer$#2.offset)| .cse4 (select |c_#memory_$Pointer$#2.offset| .cse4))) (.cse3 (store |c_old(#memory_$Pointer$#2.base)| .cse20 (select |c_#memory_$Pointer$#2.base| .cse20)))) (let ((.cse2 (@diff .cse3 |c_#memory_$Pointer$#2.base|)) (.cse5 (@diff .cse6 |c_#memory_$Pointer$#2.offset|))) (let ((.cse19 (@diff |c_old(#valid)| |c_#valid|)) (.cse8 (store .cse6 .cse5 (select |c_#memory_$Pointer$#2.offset| .cse5))) (.cse0 (store .cse3 .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)))) (let ((.cse1 (@diff .cse0 |c_#memory_$Pointer$#2.base|)) (.cse9 (@diff .cse8 |c_#memory_$Pointer$#2.offset|)) (.cse7 (select |c_#valid| .cse19))) (and (= (store .cse0 .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse2) 0) (= .cse3 |c_#memory_$Pointer$#2.base|)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (or (= (select |c_old(#valid)| .cse4) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (or (= 0 (select |c_old(#valid)| .cse5)) (= .cse6 |c_#memory_$Pointer$#2.offset|)) (or (= (select |c_old(#valid)| .cse1) 0) (= .cse0 |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (or (= |c_#valid| |c_old(#valid)|) (= .cse7 1)) (= |c_#memory_$Pointer$#2.offset| (store .cse8 .cse9 (select |c_#memory_$Pointer$#2.offset| .cse9))) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse16 (store (store |v_#memory_$Pointer$#2.base_224| .cse13 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse11 (select (select .cse16 .cse13) 4))) (let ((.cse12 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse11) (+ v_arrayElimCell_196 4))) (.cse14 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse10 (select |v_#valid_BEFORE_CALL_48| .cse10)))) (= .cse11 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse11) (= (select |v_old(#valid)_AFTER_CALL_48| .cse13) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse14 (select |v_#memory_$Pointer$#2.base_224| .cse14)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse12) 1) (= .cse13 .cse14) (= v_DerPreprocessor_33 (let ((.cse15 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse11) .cse15 (select (select .cse16 .cse11) .cse15))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse13) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse18 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse17 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse17 (select |v_#valid_BEFORE_CALL_48| .cse17)))) (= (select |v_#valid_BEFORE_CALL_48| .cse18) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse18) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (or (= .cse8 |c_#memory_$Pointer$#2.offset|) (= (select |c_old(#valid)| .cse9) 0)) (= |c_#valid| (store |c_old(#valid)| .cse19 .cse7)) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse20) 0)) (<= 0 |c_node_create_#res#1.offset|))))))) is different from true [2024-11-22 19:01:07,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse0 (select .cse27 0))) (let ((.cse14 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse15 (select .cse27 |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (and (let ((.cse9 (+ .cse4 4)) (.cse10 (select |c_#memory_$Pointer$#2.base| .cse0))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse3 (store (store |v_#memory_$Pointer$#2.base_224| .cse0 .cse10) v_DerPreprocessor_38 .cse5))) (let ((.cse1 (select (select .cse3 .cse0) 4))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse8 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) .cse9))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 0) (= (let ((.cse2 (+ .cse4 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse2 (select (select .cse3 .cse1) .cse2))) .cse5) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse6 (select |v_old(#valid)_AFTER_CALL_49| .cse6))) |v_old(#valid)_AFTER_CALL_49|) (= |c_#memory_$Pointer$#2.base| (store .cse3 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7 (select |v_#memory_$Pointer$#2.base_224| .cse7)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse1) (= .cse7 .cse0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) 1) (= v_DerPreprocessor_38 .cse1))))))) (let ((.cse12 (select .cse10 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse12) .cse9))) (and (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1) (= (let ((.cse11 (@diff v_prenex_29 |v_old(#valid)_AFTER_CALL_49|))) (store v_prenex_29 .cse11 (select |v_old(#valid)_AFTER_CALL_49| .cse11))) |v_old(#valid)_AFTER_CALL_49|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= 1 (select v_prenex_29 .cse12)) (= (select v_prenex_29 .cse13) 1))) (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse13) (+ v_prenex_30 8)) .cse12)) (= .cse12 .cse13))))))) (= (select .cse14 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse15) 4) 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse19 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse22 (store (store |v_#memory_$Pointer$#2.base_224| .cse19 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse17 (select (select .cse22 .cse19) 4))) (let ((.cse18 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse17) (+ v_arrayElimCell_196 4))) (.cse20 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse16 (select |v_#valid_BEFORE_CALL_48| .cse16)))) (= .cse17 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse18) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse17) (= (select |v_old(#valid)_AFTER_CALL_48| .cse19) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse20 (select |v_#memory_$Pointer$#2.base_224| .cse20)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse17) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse18) 1) (= .cse19 .cse20) (= v_DerPreprocessor_33 (let ((.cse21 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse17) .cse21 (select (select .cse22 .cse17) .cse21))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse19) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse24 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse23 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse23 (select |v_#valid_BEFORE_CALL_48| .cse23)))) (= (select |v_#valid_BEFORE_CALL_48| .cse24) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse24) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= (select .cse14 0) 0) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.base| .cse15) 4))) (let ((.cse25 (select (select |c_#memory_$Pointer$#2.base| .cse26) 4))) (or (= .cse25 .cse26) (= (select |c_#valid| .cse25) 1)))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (<= 0 .cse4))))) is different from false [2024-11-22 19:01:07,862 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse0 (select .cse27 0))) (let ((.cse14 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse15 (select .cse27 |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (and (let ((.cse9 (+ .cse4 4)) (.cse10 (select |c_#memory_$Pointer$#2.base| .cse0))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse3 (store (store |v_#memory_$Pointer$#2.base_224| .cse0 .cse10) v_DerPreprocessor_38 .cse5))) (let ((.cse1 (select (select .cse3 .cse0) 4))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse8 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse1) .cse9))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 0) (= (let ((.cse2 (+ .cse4 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse1) .cse2 (select (select .cse3 .cse1) .cse2))) .cse5) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse6 (select |v_old(#valid)_AFTER_CALL_49| .cse6))) |v_old(#valid)_AFTER_CALL_49|) (= |c_#memory_$Pointer$#2.base| (store .cse3 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7 (select |v_#memory_$Pointer$#2.base_224| .cse7)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse1) (= .cse7 .cse0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) 1) (= v_DerPreprocessor_38 .cse1))))))) (let ((.cse12 (select .cse10 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse12) .cse9))) (and (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1) (= (let ((.cse11 (@diff v_prenex_29 |v_old(#valid)_AFTER_CALL_49|))) (store v_prenex_29 .cse11 (select |v_old(#valid)_AFTER_CALL_49| .cse11))) |v_old(#valid)_AFTER_CALL_49|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= 1 (select v_prenex_29 .cse12)) (= (select v_prenex_29 .cse13) 1))) (or (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse13) (+ v_prenex_30 8)) .cse12)) (= .cse12 .cse13))))))) (= (select .cse14 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse15) 4) 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_196 Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse19 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse22 (store (store |v_#memory_$Pointer$#2.base_224| .cse19 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33))) (let ((.cse17 (select (select .cse22 .cse19) 4))) (let ((.cse18 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse17) (+ v_arrayElimCell_196 4))) (.cse20 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_48| .cse16 (select |v_#valid_BEFORE_CALL_48| .cse16)))) (= .cse17 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse18) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))) (= v_DerPreprocessor_31 .cse17) (= (select |v_old(#valid)_AFTER_CALL_48| .cse19) 0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse20 (select |v_#memory_$Pointer$#2.base_224| .cse20)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse17) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse18) 1) (= .cse19 .cse20) (= v_DerPreprocessor_33 (let ((.cse21 (+ v_arrayElimCell_196 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse17) .cse21 (select (select .cse22 .cse17) .cse21))))))))) (= (select |v_#valid_BEFORE_CALL_48| .cse19) 1)))) (<= 0 v_arrayElimCell_196))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0) (exists ((v_arrayElimCell_197 Int) (v_arrayElimCell_199 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (v_prenex_29 (Array Int Int))) (let ((.cse24 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0))) (and (= |v_#valid_BEFORE_CALL_48| (let ((.cse23 (@diff v_prenex_29 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_29 .cse23 (select |v_#valid_BEFORE_CALL_48| .cse23)))) (= (select |v_#valid_BEFORE_CALL_48| .cse24) 1) (= (select v_prenex_29 v_arrayElimCell_199) 1) (= (select v_prenex_29 .cse24) 0) (= (select v_prenex_29 v_arrayElimCell_197) 1))))))) (= (select .cse14 0) 0) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.base| .cse15) 4))) (let ((.cse25 (select (select |c_#memory_$Pointer$#2.base| .cse26) 4))) (or (= .cse25 .cse26) (= (select |c_#valid| .cse25) 1)))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (<= 0 .cse4))))) is different from true [2024-11-22 19:01:07,880 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (let ((.cse0 (select .cse13 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#2.base| .cse0))) (and (let ((.cse4 (+ .cse9 4))) (or (let ((.cse1 (select .cse3 .cse4))) (and (or (= .cse0 .cse1) (exists ((v_prenex_30 Int)) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_30 8))))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select v_prenex_29 .cse0) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (let ((.cse2 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse2 (select v_prenex_33 .cse2))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0))))) (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse8 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse13) v_DerPreprocessor_38 .cse5))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6) .cse4)) (.cse12 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= .cse5 (let ((.cse7 (+ 8 .cse9))) (store (select |v_#memory_$Pointer$#2.base_224| .cse6) .cse7 (select (select .cse8 .cse6) .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |v_old(#valid)_AFTER_CALL_49| .cse11))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse12 (select |v_#memory_$Pointer$#2.base_224| .cse12)) |v_#memory_$Pointer$#2.base_224|) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse6) (= .cse6 v_DerPreprocessor_38) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= |c_#memory_$Pointer$#2.base| (store .cse8 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= .cse12 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1))))))))) (<= 0 .cse9) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (= .cse9 0) (let ((.cse14 (select .cse3 4))) (or (= .cse0 .cse14) (= (select |c_#valid| .cse14) 1))))))) is different from false [2024-11-22 19:01:07,886 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (let ((.cse0 (select .cse13 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#2.base| .cse0))) (and (let ((.cse4 (+ .cse9 4))) (or (let ((.cse1 (select .cse3 .cse4))) (and (or (= .cse0 .cse1) (exists ((v_prenex_30 Int)) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_30 8))))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select v_prenex_29 .cse0) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (let ((.cse2 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse2 (select v_prenex_33 .cse2))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0))))) (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse8 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse13) v_DerPreprocessor_38 .cse5))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6) .cse4)) (.cse12 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (and (= .cse5 (let ((.cse7 (+ 8 .cse9))) (store (select |v_#memory_$Pointer$#2.base_224| .cse6) .cse7 (select (select .cse8 .cse6) .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |v_old(#valid)_AFTER_CALL_49| .cse11))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse12 (select |v_#memory_$Pointer$#2.base_224| .cse12)) |v_#memory_$Pointer$#2.base_224|) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse6) (= .cse6 v_DerPreprocessor_38) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= |c_#memory_$Pointer$#2.base| (store .cse8 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= .cse12 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1))))))))) (<= 0 .cse9) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (= .cse9 0) (let ((.cse14 (select .cse3 4))) (or (= .cse0 .cse14) (= (select |c_#valid| .cse14) 1))))))) is different from true [2024-11-22 19:01:07,901 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse1 (select .cse12 4))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (and (let ((.cse0 (select .cse2 4))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 .cse1))) (let ((.cse11 (+ 4 .cse8))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse11))) (and (= v_DerPreprocessor_38 .cse3) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store .cse4 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_49| .cse5))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (let ((.cse7 (+ 8 .cse8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse4 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse3) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0))))))) (let ((.cse14 (select .cse2 .cse11))) (and (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse13 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse13 (select v_prenex_33 .cse13))) v_prenex_33) (= (select v_prenex_29 .cse14) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_33 v_prenex_32) 0))) (or (= .cse14 .cse1) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse14) (+ v_prenex_30 8)) .cse1))))))) (<= 0 .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= 0 .cse8))))) is different from false [2024-11-22 19:01:07,907 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse1 (select .cse12 4))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (and (let ((.cse0 (select .cse2 4))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 .cse1))) (let ((.cse11 (+ 4 .cse8))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse11))) (and (= v_DerPreprocessor_38 .cse3) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store .cse4 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_49| .cse5))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (let ((.cse7 (+ 8 .cse8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse4 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse3) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0))))))) (let ((.cse14 (select .cse2 .cse11))) (and (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse13 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse13 (select v_prenex_33 .cse13))) v_prenex_33) (= (select v_prenex_29 .cse14) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_33 v_prenex_32) 0))) (or (= .cse14 .cse1) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse14) (+ v_prenex_30 8)) .cse1))))))) (<= 0 .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= 0 .cse8))))) is different from true [2024-11-22 19:01:07,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse1 (select .cse12 4))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (and (let ((.cse0 (select .cse2 4))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 .cse1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (let ((.cse11 (+ 4 .cse8))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse11))) (and (= v_DerPreprocessor_38 .cse3) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store .cse4 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_49| .cse5))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (let ((.cse7 (+ 8 .cse8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse4 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse3) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0))))))) (let ((.cse14 (select .cse2 .cse11))) (and (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse13 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse13 (select v_prenex_33 .cse13))) v_prenex_33) (= (select v_prenex_29 .cse14) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_33 v_prenex_32) 0))) (or (= .cse14 .cse1) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse14) (+ v_prenex_30 8)) .cse1))))))) (<= 0 .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (= 0 .cse8))))) is different from false [2024-11-22 19:01:07,928 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse1 (select .cse12 4))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (and (let ((.cse0 (select .cse2 4))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 .cse1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (let ((.cse11 (+ 4 .cse8))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse11))) (and (= v_DerPreprocessor_38 .cse3) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store .cse4 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_49| .cse5))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (let ((.cse7 (+ 8 .cse8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse4 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse3) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0))))))) (let ((.cse14 (select .cse2 .cse11))) (and (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse13 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse13 (select v_prenex_33 .cse13))) v_prenex_33) (= (select v_prenex_29 .cse14) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_33 v_prenex_32) 0))) (or (= .cse14 .cse1) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse14) (+ v_prenex_30 8)) .cse1))))))) (<= 0 .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (= 0 .cse8))))) is different from true [2024-11-22 19:01:07,944 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse1 (select .cse12 4))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (and (let ((.cse0 (select .cse2 4))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 .cse1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (let ((.cse11 (+ 4 .cse8))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse11))) (and (= v_DerPreprocessor_38 .cse3) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store .cse4 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_49| .cse5))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (let ((.cse7 (+ 8 .cse8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse4 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse3) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0))))))) (let ((.cse14 (select .cse2 .cse11))) (and (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse13 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse13 (select v_prenex_33 .cse13))) v_prenex_33) (= (select v_prenex_29 .cse14) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_33 v_prenex_32) 0))) (or (= .cse14 .cse1) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse14) (+ v_prenex_30 8)) .cse1))))))) (<= 0 .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= 0 .cse8))))) is different from false [2024-11-22 19:01:07,948 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse1 (select .cse12 4))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (and (let ((.cse0 (select .cse2 4))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 .cse1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (let ((.cse11 (+ 4 .cse8))) (or (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_224| |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|)) (.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse11))) (and (= v_DerPreprocessor_38 .cse3) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store .cse4 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_49| .cse5))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse6 (select |v_#memory_$Pointer$#2.base_224| .cse6)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (let ((.cse7 (+ 8 .cse8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse4 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse3) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0))))))) (let ((.cse14 (select .cse2 .cse11))) (and (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse13 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse13 (select v_prenex_33 .cse13))) v_prenex_33) (= (select v_prenex_29 .cse14) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_33 v_prenex_32) 0))) (or (= .cse14 .cse1) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse14) (+ v_prenex_30 8)) .cse1))))))) (<= 0 .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= 0 .cse8))))) is different from true [2024-11-22 19:01:07,990 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0) (let ((.cse3 (+ |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 4))) (or (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse3))) (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse1) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_29 .cse2) 1) (exists ((v_prenex_30 Int)) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_30 8)))))))))) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse9 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse9)) (.cse7 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse9 .cse11) v_DerPreprocessor_38 .cse7))) (let ((.cse4 (select (select .cse6 .cse9) 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4) .cse3))) (and (= v_DerPreprocessor_38 .cse4) (= (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse4) .cse5 (select (select .cse6 .cse4) .cse5))) .cse7) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse8 (select |v_old(#valid)_AFTER_CALL_49| .cse8))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse9 (select |v_#memory_$Pointer$#2.base_224| .cse9)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (store .cse6 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_48| .cse4)) (= (select |v_old(#valid)_AFTER_CALL_49| .cse9) 1) (= (select .cse11 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|)))))))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 v_prenex_32) 0) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse12 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse12 (select v_prenex_33 .cse12))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse13) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse13) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse13) .cse3) .cse13)))))))))) (<= 0 |c_ULTIMATE.start_dll_append_#t~mem11#1.offset|) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 4))) (or (= .cse14 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= 1 (select |c_#valid| .cse14))))) is different from false [2024-11-22 19:01:08,016 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0) (let ((.cse3 (+ |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 4))) (or (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse3))) (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse1) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse1) 1) (= (select v_prenex_29 .cse2) 1) (exists ((v_prenex_30 Int)) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_30 8)))))))))) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse9 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse9)) (.cse7 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_224| .cse9 .cse11) v_DerPreprocessor_38 .cse7))) (let ((.cse4 (select (select .cse6 .cse9) 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse4) .cse3))) (and (= v_DerPreprocessor_38 .cse4) (= (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse4) .cse5 (select (select .cse6 .cse4) .cse5))) .cse7) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse8 (select |v_old(#valid)_AFTER_CALL_49| .cse8))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse9 (select |v_#memory_$Pointer$#2.base_224| .cse9)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (store .cse6 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_48| .cse4)) (= (select |v_old(#valid)_AFTER_CALL_49| .cse9) 1) (= (select .cse11 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|)))))))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_33 v_prenex_32) 0) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse12 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse12 (select v_prenex_33 .cse12))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse13) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse13) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse13) .cse3) .cse13)))))))))) (<= 0 |c_ULTIMATE.start_dll_append_#t~mem11#1.offset|) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 4))) (or (= .cse14 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= 1 (select |c_#valid| .cse14))))) is different from true [2024-11-22 19:01:08,091 WARN L851 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= (select |c_#valid| .cse0) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (let ((.cse4 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse1 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse1 (select v_prenex_33 .cse1))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4))) (and (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_30 8)) .cse3)) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse3) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (= (select v_prenex_29 .cse2) 1))))))) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse5 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse5 (select v_prenex_33 .cse5))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (and (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse4) .cse6) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse6) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)))))) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse9 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse9)) (.cse13 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse10 (store (store |v_#memory_$Pointer$#2.base_224| .cse9 .cse12) v_DerPreprocessor_38 .cse13))) (let ((.cse7 (select (select .cse10 .cse9) 4))) (let ((.cse11 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7) .cse4))) (and (= v_DerPreprocessor_38 .cse7) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse8 (select |v_old(#valid)_AFTER_CALL_49| .cse8))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse9 (select |v_#memory_$Pointer$#2.base_224| .cse9)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (store .cse10 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse11) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse7) (= 1 (select |v_old(#valid)_AFTER_CALL_48| .cse7)) (= (select |v_old(#valid)_AFTER_CALL_48| .cse11) 1) (= (select .cse12 4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_49| .cse9) 1) (= .cse13 (let ((.cse14 (+ 8 |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (store (select |v_#memory_$Pointer$#2.base_224| .cse7) .cse14 (select (select .cse10 .cse7) .cse14)))))))))))))) is different from false [2024-11-22 19:01:08,130 WARN L873 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= (select |c_#valid| .cse0) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (let ((.cse4 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse1 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse1 (select v_prenex_33 .cse1))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4))) (and (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (exists ((v_prenex_30 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_30 8)) .cse3)) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse3) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (= (select v_prenex_29 .cse2) 1))))))) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (exists ((v_prenex_29 (Array Int Int))) (and (= (let ((.cse5 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse5 (select v_prenex_33 .cse5))) v_prenex_33) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (and (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse4) .cse6) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 .cse6) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)))))) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse9 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse9)) (.cse13 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_38))) (let ((.cse10 (store (store |v_#memory_$Pointer$#2.base_224| .cse9 .cse12) v_DerPreprocessor_38 .cse13))) (let ((.cse7 (select (select .cse10 .cse9) 4))) (let ((.cse11 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse7) .cse4))) (and (= v_DerPreprocessor_38 .cse7) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse8 (select |v_old(#valid)_AFTER_CALL_49| .cse8))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse9 (select |v_#memory_$Pointer$#2.base_224| .cse9)) |v_#memory_$Pointer$#2.base_224|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (store .cse10 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse11) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8)) .cse7) (= 1 (select |v_old(#valid)_AFTER_CALL_48| .cse7)) (= (select |v_old(#valid)_AFTER_CALL_48| .cse11) 1) (= (select .cse12 4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_49| .cse9) 1) (= .cse13 (let ((.cse14 (+ 8 |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (store (select |v_#memory_$Pointer$#2.base_224| .cse7) .cse14 (select (select .cse10 .cse7) .cse14)))))))))))))) is different from true [2024-11-22 19:01:08,168 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimCell_214 Int) (v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 v_arrayElimCell_214) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_48| Int)) (and (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_48|) (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse4 (store (store (store |v_#memory_$Pointer$#2.base_224| .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) |node_create_~temp~0#1.base| v_DerPreprocessor_43))) (let ((.cse5 (select .cse4 .cse2)) (.cse9 (select .cse4 v_DerPreprocessor_38))) (let ((.cse8 (store (store |v_#memory_$Pointer$#2.base_224| .cse2 .cse5) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse8 .cse2) 4)) (.cse6 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse6))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_old(#valid)_AFTER_CALL_49| .cse1))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2 (select |v_#memory_$Pointer$#2.base_224| .cse2)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= v_DerPreprocessor_38 .cse3) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select (select .cse4 (select .cse5 4)) .cse6)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 0) (= (let ((.cse7 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse8 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))))))))))))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (let ((.cse11 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse11 (select v_prenex_33 .cse11))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1)) is different from false [2024-11-22 19:01:08,173 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimCell_214 Int) (v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 v_arrayElimCell_214) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_48| Int)) (and (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_48|) (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse4 (store (store (store |v_#memory_$Pointer$#2.base_224| .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) |node_create_~temp~0#1.base| v_DerPreprocessor_43))) (let ((.cse5 (select .cse4 .cse2)) (.cse9 (select .cse4 v_DerPreprocessor_38))) (let ((.cse8 (store (store |v_#memory_$Pointer$#2.base_224| .cse2 .cse5) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse8 .cse2) 4)) (.cse6 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse6))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_old(#valid)_AFTER_CALL_49| .cse1))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2 (select |v_#memory_$Pointer$#2.base_224| .cse2)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= v_DerPreprocessor_38 .cse3) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select (select .cse4 (select .cse5 4)) .cse6)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 0) (= (let ((.cse7 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse8 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))))))))))))) (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (let ((.cse11 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse11 (select v_prenex_33 .cse11))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1)) is different from true [2024-11-22 19:01:08,240 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (or (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= 1 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_48| Int)) (and (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse4 (store (store (store |v_#memory_$Pointer$#2.base_224| .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) |node_create_~temp~0#1.base| v_DerPreprocessor_43))) (let ((.cse5 (select .cse4 .cse2)) (.cse9 (select .cse4 v_DerPreprocessor_38))) (let ((.cse8 (store (store |v_#memory_$Pointer$#2.base_224| .cse2 .cse5) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse8 .cse2) 4)) (.cse6 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse6))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_old(#valid)_AFTER_CALL_49| .cse1))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2 (select |v_#memory_$Pointer$#2.base_224| .cse2)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= v_DerPreprocessor_38 .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse4 (select .cse5 4)) .cse6)) (= (let ((.cse7 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse8 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))))))))))) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_48|))) (exists ((v_arrayElimCell_214 Int) (v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 v_arrayElimCell_214) 1) (= 1 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse11 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse11 (select v_prenex_33 .cse11))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0))))) is different from false [2024-11-22 19:01:08,245 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (or (exists ((v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= 1 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse0 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse0 (select v_prenex_33 .cse0))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_48| Int)) (and (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_38 Int) (|v_#memory_$Pointer$#2.base_224| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_27| Int)) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| |v_#memory_$Pointer$#2.base_224|))) (let ((.cse4 (store (store (store |v_#memory_$Pointer$#2.base_224| .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) |node_create_~temp~0#1.base| v_DerPreprocessor_43))) (let ((.cse5 (select .cse4 .cse2)) (.cse9 (select .cse4 v_DerPreprocessor_38))) (let ((.cse8 (store (store |v_#memory_$Pointer$#2.base_224| .cse2 .cse5) v_DerPreprocessor_38 .cse9))) (let ((.cse3 (select (select .cse8 .cse2) 4)) (.cse6 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 4))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse3) .cse6))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_49|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_old(#valid)_AFTER_CALL_49| .cse1))) |v_old(#valid)_AFTER_CALL_49|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse2 (select |v_#memory_$Pointer$#2.base_224| .cse2)) |v_#memory_$Pointer$#2.base_224|) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= v_DerPreprocessor_38 .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_49| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse4 (select .cse5 4)) .cse6)) (= (let ((.cse7 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_48| 8))) (store (select |v_#memory_$Pointer$#2.base_224| .cse3) .cse7 (select (select .cse8 .cse3) .cse7))) .cse9) (= (select |v_old(#valid)_AFTER_CALL_48| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_48| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_27| 8))))))))))) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_48|))) (exists ((v_arrayElimCell_214 Int) (v_prenex_32 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (and (= |c_#valid| (store v_prenex_33 v_prenex_32 1)) (= (select v_prenex_29 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0) (= (select v_prenex_33 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select v_prenex_29 v_arrayElimCell_214) 1) (= 1 (select v_prenex_29 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse11 (@diff v_prenex_29 v_prenex_33))) (store v_prenex_29 .cse11 (select v_prenex_33 .cse11))) v_prenex_33) (= (select v_prenex_33 v_prenex_32) 0))))) is different from true [2024-11-22 19:01:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:01:08,320 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2024-11-22 19:01:08,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-22 19:01:08,321 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 59 states have (on average 2.0338983050847457) internal successors, (120), 55 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 75 [2024-11-22 19:01:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:01:08,322 INFO L225 Difference]: With dead ends: 197 [2024-11-22 19:01:08,322 INFO L226 Difference]: Without dead ends: 197 [2024-11-22 19:01:08,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 42 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=280, Invalid=3110, Unknown=84, NotChecked=6426, Total=9900 [2024-11-22 19:01:08,323 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 53 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 6018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4601 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:01:08,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1566 Invalid, 6018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1408 Invalid, 0 Unknown, 4601 Unchecked, 1.0s Time] [2024-11-22 19:01:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-22 19:01:08,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 155. [2024-11-22 19:01:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 131 states have (on average 1.2061068702290076) internal successors, (158), 146 states have internal predecessors, (158), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 19:01:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2024-11-22 19:01:08,326 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 75 [2024-11-22 19:01:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:01:08,326 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2024-11-22 19:01:08,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 59 states have (on average 2.0338983050847457) internal successors, (120), 55 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-22 19:01:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2024-11-22 19:01:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-22 19:01:08,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:01:08,328 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:01:08,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-22 19:01:08,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-22 19:01:08,528 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 19:01:08,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:01:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash -485300560, now seen corresponding path program 2 times [2024-11-22 19:01:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:01:08,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505825913] [2024-11-22 19:01:08,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:01:08,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:01:08,554 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 19:01:08,554 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:01:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-22 19:01:08,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:01:08,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505825913] [2024-11-22 19:01:08,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505825913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:01:08,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755639870] [2024-11-22 19:01:08,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:01:08,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:01:08,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:01:08,617 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:01:08,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-22 19:01:08,875 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 19:01:08,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:01:08,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 19:01:08,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:01:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-22 19:01:08,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 19:01:08,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755639870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:01:08,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 19:01:08,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-22 19:01:08,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258474079] [2024-11-22 19:01:08,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:01:08,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 19:01:08,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:01:08,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 19:01:08,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:01:08,903 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 19:01:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:01:08,919 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2024-11-22 19:01:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 19:01:08,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 75 [2024-11-22 19:01:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:01:08,919 INFO L225 Difference]: With dead ends: 102 [2024-11-22 19:01:08,920 INFO L226 Difference]: Without dead ends: 102 [2024-11-22 19:01:08,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:01:08,920 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:01:08,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:01:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-22 19:01:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-22 19:01:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.2) internal successors, (102), 96 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 19:01:08,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2024-11-22 19:01:08,922 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 75 [2024-11-22 19:01:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:01:08,922 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2024-11-22 19:01:08,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 19:01:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2024-11-22 19:01:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-22 19:01:08,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:01:08,923 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:01:08,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-22 19:01:09,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-22 19:01:09,125 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-22 19:01:09,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:01:09,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2132047617, now seen corresponding path program 1 times [2024-11-22 19:01:09,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:01:09,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274470355] [2024-11-22 19:01:09,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:01:09,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:01:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat