./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:51:48,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:51:49,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:51:49,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:51:49,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:51:49,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:51:49,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:51:49,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:51:49,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:51:49,084 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:51:49,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:51:49,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:51:49,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:51:49,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:51:49,086 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:51:49,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:51:49,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:51:49,087 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:51:49,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:51:49,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:51:49,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:51:49,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:51:49,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:51:49,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:51:49,091 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:51:49,091 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:51:49,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:51:49,092 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:51:49,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:51:49,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:51:49,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:51:49,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:51:49,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:51:49,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:51:49,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:51:49,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:51:49,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:51:49,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:51:49,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:51:49,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:51:49,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:51:49,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:51:49,096 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2024-10-14 01:51:49,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:51:49,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:51:49,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:51:49,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:51:49,341 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:51:49,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2024-10-14 01:51:50,566 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:51:50,758 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:51:50,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2024-10-14 01:51:50,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e692c74/50360c0d0f8b44348a8c6b55a43ca65a/FLAGe358103bc [2024-10-14 01:51:51,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e692c74/50360c0d0f8b44348a8c6b55a43ca65a [2024-10-14 01:51:51,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:51:51,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:51:51,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:51:51,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:51:51,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:51:51,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f050ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51, skipping insertion in model container [2024-10-14 01:51:51,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:51:51,408 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2024-10-14 01:51:51,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:51:51,425 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:51:51,480 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2024-10-14 01:51:51,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:51:51,510 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:51:51,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51 WrapperNode [2024-10-14 01:51:51,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:51:51,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:51:51,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:51:51,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:51:51,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,547 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2024-10-14 01:51:51,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:51:51,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:51:51,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:51:51,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:51:51,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,579 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 9, 20]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2024-10-14 01:51:51,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:51:51,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:51:51,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:51:51,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:51:51,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51" (1/1) ... [2024-10-14 01:51:51,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:51:51,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:51:51,644 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-10-14 01:51:51,646 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-10-14 01:51:51,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 01:51:51,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 01:51:51,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 01:51:51,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 01:51:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 01:51:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 01:51:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-14 01:51:51,690 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-14 01:51:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:51:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:51:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 01:51:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 01:51:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 01:51:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 01:51:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 01:51:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 01:51:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 01:51:51,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 01:51:51,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 01:51:51,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 01:51:51,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 01:51:51,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:51:51,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:51:51,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 01:51:51,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:51:51,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:51:51,787 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:51:51,788 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:51:51,959 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-14 01:51:51,959 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:51:51,990 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:51:51,991 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-14 01:51:51,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:51:51 BoogieIcfgContainer [2024-10-14 01:51:51,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:51:51,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:51:51,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:51:51,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:51:51,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:51:51" (1/3) ... [2024-10-14 01:51:51,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731dc7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:51:51, skipping insertion in model container [2024-10-14 01:51:51,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:51" (2/3) ... [2024-10-14 01:51:51,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731dc7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:51:51, skipping insertion in model container [2024-10-14 01:51:51,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:51:51" (3/3) ... [2024-10-14 01:51:52,000 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2024-10-14 01:51:52,012 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:51:52,013 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:51:52,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:51:52,055 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23c4165b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:51:52,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:51:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:51:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 01:51:52,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:51:52,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:51:52,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:51:52,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:51:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash -977421440, now seen corresponding path program 1 times [2024-10-14 01:51:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:51:52,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139842626] [2024-10-14 01:51:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:51:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:51:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:52,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:51:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:52,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:51:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:51:52,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:51:52,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139842626] [2024-10-14 01:51:52,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139842626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:51:52,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:51:52,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 01:51:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945877438] [2024-10-14 01:51:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:51:52,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 01:51:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:51:52,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 01:51:52,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:51:52,369 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:51:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:51:52,434 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2024-10-14 01:51:52,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 01:51:52,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 18 [2024-10-14 01:51:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:51:52,440 INFO L225 Difference]: With dead ends: 54 [2024-10-14 01:51:52,441 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 01:51:52,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:51:52,446 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:51:52,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:51:52,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 01:51:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 01:51:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:51:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-14 01:51:52,471 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2024-10-14 01:51:52,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:51:52,472 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-14 01:51:52,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:51:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-14 01:51:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 01:51:52,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:51:52,474 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:51:52,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:51:52,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:51:52,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:51:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1639470509, now seen corresponding path program 1 times [2024-10-14 01:51:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:51:52,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263640606] [2024-10-14 01:51:52,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:51:52,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:51:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:52,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:51:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:52,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:51:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:51:52,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:51:52,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263640606] [2024-10-14 01:51:52,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263640606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:51:52,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:51:52,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:51:52,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484185179] [2024-10-14 01:51:52,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:51:52,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:51:52,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:51:52,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:51:52,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:51:52,699 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:51:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:51:52,746 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2024-10-14 01:51:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:51:52,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 18 [2024-10-14 01:51:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:51:52,747 INFO L225 Difference]: With dead ends: 45 [2024-10-14 01:51:52,747 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 01:51:52,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:51:52,750 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:51:52,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:51:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 01:51:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-10-14 01:51:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:51:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-10-14 01:51:52,757 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 18 [2024-10-14 01:51:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:51:52,757 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-14 01:51:52,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:51:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-10-14 01:51:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 01:51:52,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:51:52,759 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:51:52,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:51:52,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:51:52,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:51:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2143999192, now seen corresponding path program 1 times [2024-10-14 01:51:52,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:51:52,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872703965] [2024-10-14 01:51:52,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:51:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:51:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:53,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:51:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:53,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:51:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:53,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 01:51:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 01:51:53,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:51:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872703965] [2024-10-14 01:51:53,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872703965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:51:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342118636] [2024-10-14 01:51:53,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:51:53,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:51:53,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:51:53,121 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-10-14 01:51:53,122 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-10-14 01:51:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:53,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 01:51:53,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:51:53,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-14 01:51:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:51:53,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:51:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 01:51:53,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342118636] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:51:53,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:51:53,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-10-14 01:51:53,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864349217] [2024-10-14 01:51:53,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:51:53,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 01:51:53,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:51:53,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 01:51:53,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 01:51:53,414 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 01:51:57,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:52:01,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:52:05,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:52:09,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:52:13,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:52:17,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:52:21,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:52:21,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:21,710 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2024-10-14 01:52:21,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 01:52:21,710 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 26 [2024-10-14 01:52:21,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:21,711 INFO L225 Difference]: With dead ends: 52 [2024-10-14 01:52:21,711 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 01:52:21,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-14 01:52:21,713 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:21,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 214 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2024-10-14 01:52:21,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 01:52:21,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-14 01:52:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 01:52:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-14 01:52:21,717 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2024-10-14 01:52:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:21,717 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-14 01:52:21,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 01:52:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-14 01:52:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 01:52:21,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:21,718 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:21,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 01:52:21,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:21,920 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:21,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2142152150, now seen corresponding path program 1 times [2024-10-14 01:52:21,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:21,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400192150] [2024-10-14 01:52:21,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:21,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:23,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:23,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:23,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 01:52:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:52:23,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400192150] [2024-10-14 01:52:23,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400192150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859329650] [2024-10-14 01:52:23,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:23,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:23,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:23,651 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-10-14 01:52:23,652 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-10-14 01:52:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:24,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-10-14 01:52:24,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:24,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:52:24,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:52:24,253 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:52:24,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 01:52:24,306 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-10-14 01:52:24,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 01:52:24,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:24,511 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-10-14 01:52:24,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-10-14 01:52:24,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:24,526 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 34 [2024-10-14 01:52:24,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-10-14 01:52:24,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-14 01:52:24,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:52:24,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 01:52:24,760 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 01:52:24,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-10-14 01:52:24,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:24,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-10-14 01:52:24,799 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 01:52:24,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-14 01:52:24,980 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 84 treesize of output 52 [2024-10-14 01:52:24,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:24,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:24,988 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 45 treesize of output 36 [2024-10-14 01:52:24,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-10-14 01:52:25,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:52:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:52:25,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:52:25,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_674 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2) v_ArrVal_677) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_678))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_674)))) (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|) 8)))) is different from false [2024-10-14 01:52:25,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859329650] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:25,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:52:25,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2024-10-14 01:52:25,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284615508] [2024-10-14 01:52:25,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:52:25,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 01:52:25,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:25,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 01:52:25,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1829, Unknown=11, NotChecked=86, Total=2070 [2024-10-14 01:52:25,389 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:52:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:26,162 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-10-14 01:52:26,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 01:52:26,164 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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 26 [2024-10-14 01:52:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:26,165 INFO L225 Difference]: With dead ends: 55 [2024-10-14 01:52:26,165 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 01:52:26,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=248, Invalid=3051, Unknown=11, NotChecked=112, Total=3422 [2024-10-14 01:52:26,167 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:26,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 247 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 01:52:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 01:52:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2024-10-14 01:52:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 01:52:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-14 01:52:26,173 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 26 [2024-10-14 01:52:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:26,173 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-14 01:52:26,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:52:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-14 01:52:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 01:52:26,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:26,174 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:26,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 01:52:26,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 01:52:26,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:26,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:26,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2125151189, now seen corresponding path program 1 times [2024-10-14 01:52:26,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:26,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887600369] [2024-10-14 01:52:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:27,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:27,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 01:52:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:52:27,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:27,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887600369] [2024-10-14 01:52:27,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887600369] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:27,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818958390] [2024-10-14 01:52:27,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:27,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:27,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:27,637 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-10-14 01:52:27,638 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-10-14 01:52:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:27,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-10-14 01:52:27,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:27,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:52:28,105 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2024-10-14 01:52:28,107 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2024-10-14 01:52:28,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:52:28,132 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2024-10-14 01:52:28,140 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2024-10-14 01:52:28,154 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 01:52:28,154 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 33 treesize of output 32 [2024-10-14 01:52:28,164 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from false [2024-10-14 01:52:28,165 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from true [2024-10-14 01:52:28,178 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2024-10-14 01:52:28,179 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from true [2024-10-14 01:52:28,213 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2024-10-14 01:52:28,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 104 [2024-10-14 01:52:28,218 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 104 treesize of output 94 [2024-10-14 01:52:28,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0))) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) .cse2 (store .cse4 4 .cse0)) .cse0) .cse4))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-10-14 01:52:28,258 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0))) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) .cse2 (store .cse4 4 .cse0)) .cse0) .cse4))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-10-14 01:52:28,273 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 01:52:28,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 52 [2024-10-14 01:52:28,277 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 47 treesize of output 35 [2024-10-14 01:52:28,311 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-14 01:52:28,314 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-14 01:52:28,341 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-14 01:52:28,343 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-14 01:52:28,366 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-14 01:52:28,368 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-14 01:52:28,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:28,398 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-14 01:52:28,398 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 111 treesize of output 66 [2024-10-14 01:52:28,441 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-10-14 01:52:28,444 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-10-14 01:52:28,484 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-10-14 01:52:28,486 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-10-14 01:52:28,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:28,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 153 [2024-10-14 01:52:28,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 138 [2024-10-14 01:52:28,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:28,541 INFO L349 Elim1Store]: treesize reduction 108, result has 7.7 percent of original size [2024-10-14 01:52:28,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 187 [2024-10-14 01:52:28,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 163 treesize of output 147 [2024-10-14 01:52:28,593 INFO L349 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2024-10-14 01:52:28,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 202 treesize of output 128 [2024-10-14 01:52:28,599 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-14 01:52:28,603 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-14 01:52:28,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 113 [2024-10-14 01:52:28,615 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-14 01:52:28,619 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-14 01:52:28,642 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse4 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse5 (select v_DerPreprocessor_8 4))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_6) .cse5 v_DerPreprocessor_7) .cse0 v_DerPreprocessor_8)) (.cse6 (select |c_#memory_$Pointer$#2.base| .cse1))) (and (= (select .cse4 4) .cse5) (= .cse6 (select .cse7 .cse1)) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (select .cse7 .cse5) (select |c_#memory_$Pointer$#2.base| .cse5)) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (store .cse6 4 .cse5) v_DerPreprocessor_8))))))))) is different from false [2024-10-14 01:52:28,645 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse4 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse5 (select v_DerPreprocessor_8 4))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_6) .cse5 v_DerPreprocessor_7) .cse0 v_DerPreprocessor_8)) (.cse6 (select |c_#memory_$Pointer$#2.base| .cse1))) (and (= (select .cse4 4) .cse5) (= .cse6 (select .cse7 .cse1)) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (select .cse7 .cse5) (select |c_#memory_$Pointer$#2.base| .cse5)) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (store .cse6 4 .cse5) v_DerPreprocessor_8))))))))) is different from true [2024-10-14 01:52:28,727 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse4 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse5 (select v_DerPreprocessor_8 4))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_6) .cse5 v_DerPreprocessor_7) .cse0 v_DerPreprocessor_8)) (.cse6 (select |c_#memory_$Pointer$#2.base| .cse1))) (and (= (select .cse4 4) .cse5) (= .cse6 (select .cse7 .cse1)) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (select .cse7 .cse5) (select |c_#memory_$Pointer$#2.base| .cse5)) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (store .cse6 4 .cse5) v_DerPreprocessor_8))))))))) is different from false [2024-10-14 01:52:28,730 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse4 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse5 (select v_DerPreprocessor_8 4))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_6) .cse5 v_DerPreprocessor_7) .cse0 v_DerPreprocessor_8)) (.cse6 (select |c_#memory_$Pointer$#2.base| .cse1))) (and (= (select .cse4 4) .cse5) (= .cse6 (select .cse7 .cse1)) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (select .cse7 .cse5) (select |c_#memory_$Pointer$#2.base| .cse5)) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (store .cse6 4 .cse5) v_DerPreprocessor_8))))))))) is different from true [2024-10-14 01:52:28,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:52:28,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 139 [2024-10-14 01:52:28,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:28,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:28,815 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-10-14 01:52:28,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 105 [2024-10-14 01:52:28,828 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 55 treesize of output 37 [2024-10-14 01:52:28,838 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:52:28,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:52:28,854 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_39 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_39) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|))) is different from false [2024-10-14 01:52:28,856 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_39 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_39) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|))) is different from true [2024-10-14 01:52:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-14 01:52:28,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:52:28,926 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_937 Int) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse5))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_940))) (store (store .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_939) .cse3 (store (select (store .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse4) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_937)) .cse3) .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))) is different from false [2024-10-14 01:52:28,936 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_937 Int) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse5))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_940))) (store (store .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_939) .cse3 (store (select (store .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse4) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_937)) .cse3) .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1))))) is different from false [2024-10-14 01:52:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818958390] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:29,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:52:29,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 38 [2024-10-14 01:52:29,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100767903] [2024-10-14 01:52:29,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:52:29,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-14 01:52:29,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:29,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-14 01:52:29,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=693, Unknown=28, NotChecked=990, Total=1806 [2024-10-14 01:52:29,036 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 38 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 29 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:52:29,173 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2024-10-14 01:52:29,175 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2024-10-14 01:52:29,177 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from false [2024-10-14 01:52:29,178 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from true [2024-10-14 01:52:29,180 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2024-10-14 01:52:29,182 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2024-10-14 01:52:29,183 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2024-10-14 01:52:29,185 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from true [2024-10-14 01:52:29,189 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse0 0)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse2 (select .cse3 4)) (.cse4 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1) (= .cse2 (select .cse3 0)) (not (= (select .cse4 4) .cse1)) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse5) 0))) (= .cse7 .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse2))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse5 (store .cse8 4 .cse2)) .cse2) .cse8))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (= (select .cse9 0) 0) (= (select |c_#valid| (select .cse4 0)) 1) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-14 01:52:29,191 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse0 0)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse2 (select .cse3 4)) (.cse4 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1) (= .cse2 (select .cse3 0)) (not (= (select .cse4 4) .cse1)) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse5) 0))) (= .cse7 .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse2))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse5 (store .cse8 4 .cse2)) .cse2) .cse8))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (= (select .cse9 0) 0) (= (select |c_#valid| (select .cse4 0)) 1) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-14 01:52:29,211 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-14 01:52:29,213 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-14 01:52:29,218 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-14 01:52:29,219 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-14 01:52:29,225 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (or (= .cse0 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))) is different from false [2024-10-14 01:52:29,228 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (or (= .cse0 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_27) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))) is different from true [2024-10-14 01:52:29,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse0 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse2 (select .cse3 4)) (.cse4 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1) (= .cse2 (select .cse3 0)) (not (= (select .cse4 4) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= .cse5 .cse0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_old(#valid)_AFTER_CALL_9| .cse7))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse4 0))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_#valid_BEFORE_CALL_7| .cse9))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select .cse10 0) 0) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-14 01:52:29,237 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse0 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse2 (select .cse3 4)) (.cse4 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1) (= .cse2 (select .cse3 0)) (not (= (select .cse4 4) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= .cse5 .cse0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_old(#valid)_AFTER_CALL_9| .cse7))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse4 0))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_#valid_BEFORE_CALL_7| .cse9))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select .cse10 0) 0) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-14 01:52:29,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse0 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse2 (select .cse3 4)) (.cse4 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1) (= .cse2 (select .cse3 0)) (not (= (select .cse4 4) .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse5 .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_old(#valid)_AFTER_CALL_9| .cse7))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse4 0))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_#valid_BEFORE_CALL_7| .cse9))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select .cse10 0) 0) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-14 01:52:29,259 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse0 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse2 (select .cse3 4)) (.cse4 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1) (= .cse2 (select .cse3 0)) (not (= (select .cse4 4) .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse5 .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_old(#valid)_AFTER_CALL_9| .cse7))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse4 0))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_#valid_BEFORE_CALL_7| .cse9))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select .cse10 0) 0) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-14 01:52:29,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse5 0))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse7 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (not (let ((.cse4 (select |c_#memory_$Pointer$#2.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse4 4) (select .cse4 0)))) (= (select .cse6 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_8 4))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_6) .cse8 v_DerPreprocessor_7) .cse0 v_DerPreprocessor_8)) (.cse9 (select |c_#memory_$Pointer$#2.base| .cse1))) (and (= (select .cse7 4) .cse8) (= .cse9 (select .cse10 .cse1)) (= (select |v_old(#valid)_AFTER_CALL_9| .cse8) 0) (= (select .cse10 .cse8) (select |c_#memory_$Pointer$#2.base| .cse8)) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse11 (select |v_old(#valid)_AFTER_CALL_9| .cse11))) |v_old(#valid)_AFTER_CALL_9|) (= (store .cse9 4 .cse8) v_DerPreprocessor_8))))) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-14 01:52:29,287 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse5 0))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse7 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (not (let ((.cse4 (select |c_#memory_$Pointer$#2.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse4 4) (select .cse4 0)))) (= (select .cse6 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_8 4))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_6) .cse8 v_DerPreprocessor_7) .cse0 v_DerPreprocessor_8)) (.cse9 (select |c_#memory_$Pointer$#2.base| .cse1))) (and (= (select .cse7 4) .cse8) (= .cse9 (select .cse10 .cse1)) (= (select |v_old(#valid)_AFTER_CALL_9| .cse8) 0) (= (select .cse10 .cse8) (select |c_#memory_$Pointer$#2.base| .cse8)) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse11 (select |v_old(#valid)_AFTER_CALL_9| .cse11))) |v_old(#valid)_AFTER_CALL_9|) (= (store .cse9 4 .cse8) v_DerPreprocessor_8))))) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-14 01:52:29,341 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse5 0))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse6 0)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select .cse4 0) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select (select |c_#memory_$Pointer$#2.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_8 4))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_6) .cse7 v_DerPreprocessor_7) .cse0 v_DerPreprocessor_8)) (.cse8 (select |c_#memory_$Pointer$#2.base| .cse1))) (and (= (select .cse6 4) .cse7) (= .cse8 (select .cse9 .cse1)) (= (select |v_old(#valid)_AFTER_CALL_9| .cse7) 0) (= (select .cse9 .cse7) (select |c_#memory_$Pointer$#2.base| .cse7)) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_old(#valid)_AFTER_CALL_9| .cse10))) |v_old(#valid)_AFTER_CALL_9|) (= (store .cse8 4 .cse7) v_DerPreprocessor_8))))) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-14 01:52:29,344 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse5 0))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse6 0)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_27) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select .cse4 0) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select (select |c_#memory_$Pointer$#2.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_8 4))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_6) .cse7 v_DerPreprocessor_7) .cse0 v_DerPreprocessor_8)) (.cse8 (select |c_#memory_$Pointer$#2.base| .cse1))) (and (= (select .cse6 4) .cse7) (= .cse8 (select .cse9 .cse1)) (= (select |v_old(#valid)_AFTER_CALL_9| .cse7) 0) (= (select .cse9 .cse7) (select |c_#memory_$Pointer$#2.base| .cse7)) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_old(#valid)_AFTER_CALL_9| .cse10))) |v_old(#valid)_AFTER_CALL_9|) (= (store .cse8 4 .cse7) v_DerPreprocessor_8))))) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-14 01:52:29,352 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|)) (exists ((v_arrayElimCell_39 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_39) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|)))) is different from false [2024-10-14 01:52:29,354 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|)) (exists ((v_arrayElimCell_39 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_39) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|)))) is different from true [2024-10-14 01:52:29,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:29,385 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2024-10-14 01:52:29,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 01:52:29,386 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 29 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2024-10-14 01:52:29,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:29,386 INFO L225 Difference]: With dead ends: 61 [2024-10-14 01:52:29,386 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 01:52:29,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=797, Unknown=54, NotChecked=2324, Total=3306 [2024-10-14 01:52:29,388 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1012 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:29,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 1012 Unchecked, 0.2s Time] [2024-10-14 01:52:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 01:52:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-14 01:52:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:52:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2024-10-14 01:52:29,395 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 29 [2024-10-14 01:52:29,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:29,395 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2024-10-14 01:52:29,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 29 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:52:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2024-10-14 01:52:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 01:52:29,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:29,402 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:29,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 01:52:29,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:29,603 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:29,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2125194899, now seen corresponding path program 1 times [2024-10-14 01:52:29,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:29,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175365351] [2024-10-14 01:52:29,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:31,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:31,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:31,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 01:52:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:52:31,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:31,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175365351] [2024-10-14 01:52:31,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175365351] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:31,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749070957] [2024-10-14 01:52:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:31,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:31,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:31,760 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-10-14 01:52:31,761 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-10-14 01:52:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:32,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 153 conjuncts are in the unsatisfiable core [2024-10-14 01:52:32,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:32,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:52:32,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:52:32,332 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 01:52:32,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-14 01:52:32,351 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:52:32,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 01:52:32,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:52:32,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 01:52:32,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:52:32,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 01:52:32,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 01:52:32,504 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-10-14 01:52:32,649 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2024-10-14 01:52:32,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 229 treesize of output 173 [2024-10-14 01:52:32,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:32,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2024-10-14 01:52:32,660 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 116 treesize of output 100 [2024-10-14 01:52:32,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-10-14 01:52:32,670 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 32 treesize of output 19 [2024-10-14 01:52:32,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 28 [2024-10-14 01:52:32,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2024-10-14 01:52:32,760 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 64 treesize of output 24 [2024-10-14 01:52:32,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-10-14 01:52:32,769 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-10-14 01:52:32,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:52:32,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:32,970 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 72 treesize of output 43 [2024-10-14 01:52:32,980 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-10-14 01:52:32,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 1 case distinctions, treesize of input 24 treesize of output 31 [2024-10-14 01:52:32,997 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 01:52:32,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-14 01:52:33,013 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 31 treesize of output 20 [2024-10-14 01:52:33,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:33,348 INFO L349 Elim1Store]: treesize reduction 324, result has 6.1 percent of original size [2024-10-14 01:52:33,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 616 treesize of output 725 [2024-10-14 01:52:33,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:33,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:33,364 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 58 treesize of output 43 [2024-10-14 01:52:33,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 612 treesize of output 545 [2024-10-14 01:52:33,387 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 112 treesize of output 34 [2024-10-14 01:52:33,390 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 34 treesize of output 19 [2024-10-14 01:52:33,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:33,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:33,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:33,407 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:52:33,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:33,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:33,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:33,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:33,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 373 [2024-10-14 01:52:33,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 43 [2024-10-14 01:52:33,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2024-10-14 01:52:33,727 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 331 treesize of output 203 [2024-10-14 01:52:33,743 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-14 01:52:33,744 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 1071 treesize of output 781 [2024-10-14 01:52:33,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2024-10-14 01:52:33,759 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 65 treesize of output 51 [2024-10-14 01:52:33,763 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 69 treesize of output 51 [2024-10-14 01:52:33,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-14 01:52:33,777 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-10-14 01:52:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:52:33,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:52:33,967 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_1218) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1212) .cse1 v_ArrVal_1221) (select (select (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1217))) (store .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse0) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse1))))) (store .cse2 .cse1 (store (select .cse2 .cse1) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse5) .cse6)) (+ (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1211) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1215))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse5) .cse6) 8)))) (not (= v_ArrVal_1218 (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse3))) (store (select |c_#memory_int#2| .cse0) .cse8 (select v_ArrVal_1218 .cse8))))))))) is different from false [2024-10-14 01:52:33,989 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (or (not (= v_ArrVal_1218 (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_1218 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_1218) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1212) .cse2 v_ArrVal_1221) (select (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1217))) (store .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) .cse0) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| .cse2))))) (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) .cse6) .cse7)) (+ 8 (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1211) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1215))) (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) .cse6) .cse7))))))))) is different from false [2024-10-14 01:52:34,061 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| Int) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_1233)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select .cse4 .cse1) .cse3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_1218) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_1212) .cse1 v_ArrVal_1221) (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1217) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| (store (store (select (store .cse4 .cse0 v_ArrVal_1217) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24|) 4 .cse0) 0 .cse1)))) (store .cse2 .cse1 (store (select .cse2 .cse1) .cse3 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24|))) .cse5) .cse6)) (+ 8 (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1211) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_1215))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse3 0))) .cse5) .cse6))))) (not (= (let ((.cse8 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_1234) .cse1) .cse3))) (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_1232) .cse0) .cse8 (select v_ArrVal_1218 .cse8))) v_ArrVal_1218)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24|) 0)))))) is different from false [2024-10-14 01:52:34,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749070957] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:34,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:52:34,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2024-10-14 01:52:34,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067982493] [2024-10-14 01:52:34,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:52:34,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-14 01:52:34,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:34,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-14 01:52:34,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1945, Unknown=4, NotChecked=270, Total=2352 [2024-10-14 01:52:34,066 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 44 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 34 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:52:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:35,482 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2024-10-14 01:52:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 01:52:35,482 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 34 states have internal predecessors, (44), 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 29 [2024-10-14 01:52:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:35,483 INFO L225 Difference]: With dead ends: 72 [2024-10-14 01:52:35,483 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 01:52:35,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=247, Invalid=3543, Unknown=4, NotChecked=366, Total=4160 [2024-10-14 01:52:35,485 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:35,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 258 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 917 Invalid, 2 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 01:52:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 01:52:35,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2024-10-14 01:52:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:52:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-10-14 01:52:35,501 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 29 [2024-10-14 01:52:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:35,501 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-10-14 01:52:35,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 34 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:52:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-10-14 01:52:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 01:52:35,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:35,504 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:35,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 01:52:35,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:35,705 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:35,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash 536803287, now seen corresponding path program 1 times [2024-10-14 01:52:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:35,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119182134] [2024-10-14 01:52:35,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:35,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:35,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:35,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:35,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 01:52:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 01:52:35,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119182134] [2024-10-14 01:52:35,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119182134] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887072200] [2024-10-14 01:52:35,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:35,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:35,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:35,807 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-10-14 01:52:35,809 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-10-14 01:52:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:35,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 01:52:35,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:52:35,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:52:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 01:52:35,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887072200] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:52:35,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:52:35,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-10-14 01:52:35,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216024634] [2024-10-14 01:52:35,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:52:35,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 01:52:35,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:35,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 01:52:35,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:52:35,992 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 01:52:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:36,043 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2024-10-14 01:52:36,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 01:52:36,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-10-14 01:52:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:36,045 INFO L225 Difference]: With dead ends: 85 [2024-10-14 01:52:36,045 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 01:52:36,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:52:36,046 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:36,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:52:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 01:52:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 01:52:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 01:52:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-10-14 01:52:36,058 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 29 [2024-10-14 01:52:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:36,058 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-10-14 01:52:36,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 01:52:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-10-14 01:52:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 01:52:36,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:36,059 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:36,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 01:52:36,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:36,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:36,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:36,260 INFO L85 PathProgramCache]: Analyzing trace with hash -370873652, now seen corresponding path program 1 times [2024-10-14 01:52:36,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:36,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265857663] [2024-10-14 01:52:36,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:36,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:39,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:39,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:39,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 01:52:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:52:39,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:39,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265857663] [2024-10-14 01:52:39,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265857663] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:39,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369342893] [2024-10-14 01:52:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:39,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:39,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:39,633 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-10-14 01:52:39,634 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-10-14 01:52:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:39,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 158 conjuncts are in the unsatisfiable core [2024-10-14 01:52:39,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:39,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:52:40,028 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:52:40,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 01:52:40,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:52:40,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:52:40,140 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 16 treesize of output 11 [2024-10-14 01:52:40,150 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 16 treesize of output 11 [2024-10-14 01:52:40,272 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-14 01:52:40,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 75 [2024-10-14 01:52:40,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:40,279 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 42 treesize of output 31 [2024-10-14 01:52:40,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2024-10-14 01:52:40,352 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 01:52:40,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 27 [2024-10-14 01:52:40,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-10-14 01:52:40,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:52:40,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:52:40,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:40,563 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-10-14 01:52:40,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 63 [2024-10-14 01:52:40,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:40,581 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 01:52:40,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2024-10-14 01:52:40,603 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 31 treesize of output 20 [2024-10-14 01:52:41,427 INFO L349 Elim1Store]: treesize reduction 538, result has 44.4 percent of original size [2024-10-14 01:52:41,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 615 treesize of output 742 [2024-10-14 01:52:41,598 INFO L349 Elim1Store]: treesize reduction 394, result has 21.4 percent of original size [2024-10-14 01:52:41,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 687 treesize of output 444 [2024-10-14 01:52:41,689 INFO L349 Elim1Store]: treesize reduction 100, result has 45.7 percent of original size [2024-10-14 01:52:41,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 551 treesize of output 553 [2024-10-14 01:52:41,743 INFO L349 Elim1Store]: treesize reduction 106, result has 29.8 percent of original size [2024-10-14 01:52:41,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 152 [2024-10-14 01:52:41,840 INFO L349 Elim1Store]: treesize reduction 130, result has 45.6 percent of original size [2024-10-14 01:52:41,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 234 treesize of output 296 [2024-10-14 01:52:41,883 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 67 treesize of output 25 [2024-10-14 01:52:41,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 79 [2024-10-14 01:52:41,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 79 [2024-10-14 01:52:42,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:52:42,196 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 65 treesize of output 69 [2024-10-14 01:52:42,272 INFO L349 Elim1Store]: treesize reduction 25, result has 35.9 percent of original size [2024-10-14 01:52:42,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 138 [2024-10-14 01:52:42,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:52:42,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 267 treesize of output 309 [2024-10-14 01:52:42,699 INFO L349 Elim1Store]: treesize reduction 36, result has 50.0 percent of original size [2024-10-14 01:52:42,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 214 treesize of output 207 [2024-10-14 01:52:42,978 INFO L349 Elim1Store]: treesize reduction 84, result has 38.7 percent of original size [2024-10-14 01:52:42,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 288 treesize of output 294 [2024-10-14 01:52:43,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:43,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:43,239 INFO L349 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2024-10-14 01:52:43,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 341 treesize of output 307 [2024-10-14 01:52:43,572 INFO L349 Elim1Store]: treesize reduction 204, result has 35.0 percent of original size [2024-10-14 01:52:43,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 966 treesize of output 981 [2024-10-14 01:52:45,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:45,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:52:45,767 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 1 case distinctions, treesize of input 58 treesize of output 58 [2024-10-14 01:52:45,862 INFO L349 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2024-10-14 01:52:45,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 154 treesize of output 142 [2024-10-14 01:52:45,948 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:52:45,951 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-10-14 01:52:45,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 35 [2024-10-14 01:52:45,994 INFO L349 Elim1Store]: treesize reduction 58, result has 47.7 percent of original size [2024-10-14 01:52:45,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 402 treesize of output 398 [2024-10-14 01:52:46,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:46,182 INFO L349 Elim1Store]: treesize reduction 37, result has 21.3 percent of original size [2024-10-14 01:52:46,182 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 79 treesize of output 59 [2024-10-14 01:52:46,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:46,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:46,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:46,289 INFO L349 Elim1Store]: treesize reduction 37, result has 21.3 percent of original size [2024-10-14 01:52:46,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 51 [2024-10-14 01:52:46,326 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2024-10-14 01:52:46,327 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 50 treesize of output 48 [2024-10-14 01:52:46,365 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2024-10-14 01:52:46,366 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 1 case distinctions, treesize of input 44 treesize of output 42 [2024-10-14 01:52:46,416 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 39 treesize of output 23 [2024-10-14 01:52:46,439 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 27 treesize of output 23 [2024-10-14 01:52:47,281 INFO L349 Elim1Store]: treesize reduction 124, result has 51.6 percent of original size [2024-10-14 01:52:47,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 2912 treesize of output 2925 [2024-10-14 01:52:47,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:52:47,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1493 treesize of output 1567 [2024-10-14 01:52:56,042 INFO L349 Elim1Store]: treesize reduction 748, result has 11.3 percent of original size [2024-10-14 01:52:56,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 397 treesize of output 243 [2024-10-14 01:52:56,082 INFO L349 Elim1Store]: treesize reduction 142, result has 32.1 percent of original size [2024-10-14 01:52:56,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 134 [2024-10-14 01:52:56,090 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 28 treesize of output 5 [2024-10-14 01:52:56,093 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-10-14 01:52:56,342 INFO L349 Elim1Store]: treesize reduction 666, result has 21.0 percent of original size [2024-10-14 01:52:56,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 447 treesize of output 347 [2024-10-14 01:52:56,383 INFO L349 Elim1Store]: treesize reduction 114, result has 37.0 percent of original size [2024-10-14 01:52:56,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 248 treesize of output 176 [2024-10-14 01:52:56,394 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 33 treesize of output 5 [2024-10-14 01:52:56,397 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-10-14 01:53:12,873 WARN L286 SmtUtils]: Spent 9.42s on a formula simplification. DAG size of input: 714 DAG size of output: 714 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)