./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.c -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 66688d15edd326007f633248cef0d3bb8a45393c20af38da2d40576d7b2626d4 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:54:34,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:54:34,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:54:34,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:54:34,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:54:34,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:54:34,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:54:34,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:54:34,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:54:34,887 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:54:34,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:54:34,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:54:34,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:54:34,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:54:34,888 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:54:34,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:54:34,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:54:34,888 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:54:34,888 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:54:34,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:54:34,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:54:34,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:54:34,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:54:34,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:54:34,889 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:54:34,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:54:34,889 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:54:34,889 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:54:34,889 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:54:34,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:54:34,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:54:34,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:54:34,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:34,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:54:34,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:54:34,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:54:34,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:54:34,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:34,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:54:34,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:54:34,890 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:54:34,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:54:34,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:54:34,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:54:34,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:54:34,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:54:34,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:54:34,890 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 66688d15edd326007f633248cef0d3bb8a45393c20af38da2d40576d7b2626d4 [2025-04-29 10:54:35,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:54:35,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:54:35,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:54:35,127 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:54:35,127 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:54:35,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.c [2025-04-29 10:54:36,401 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd1fbf26/93d8cb735c2c4297aba7eb903332955b/FLAG1428adf31 [2025-04-29 10:54:36,645 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:54:36,646 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.c [2025-04-29 10:54:36,648 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:54:36,648 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:54:36,654 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd1fbf26/93d8cb735c2c4297aba7eb903332955b/FLAG1428adf31 [2025-04-29 10:54:37,402 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd1fbf26/93d8cb735c2c4297aba7eb903332955b [2025-04-29 10:54:37,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:54:37,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:54:37,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:54:37,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:54:37,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:54:37,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8c0ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37, skipping insertion in model container [2025-04-29 10:54:37,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:54:37,555 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.c[1846,1859] [2025-04-29 10:54:37,559 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:54:37,565 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:54:37,597 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.c[1846,1859] [2025-04-29 10:54:37,599 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:54:37,613 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:54:37,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37 WrapperNode [2025-04-29 10:54:37,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:54:37,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:54:37,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:54:37,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:54:37,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,637 INFO L138 Inliner]: procedures = 18, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2025-04-29 10:54:37,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:54:37,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:54:37,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:54:37,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:54:37,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,660 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [20, 9]. 69 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 14 writes are split as follows [13, 1]. [2025-04-29 10:54:37,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:54:37,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:54:37,680 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:54:37,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:54:37,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (1/1) ... [2025-04-29 10:54:37,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:37,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:37,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 10:54:37,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 10:54:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:54:37,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 10:54:37,726 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 10:54:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:54:37,797 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:54:37,799 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:54:38,013 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-04-29 10:54:38,013 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:54:38,020 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:54:38,021 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 10:54:38,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:54:38 BoogieIcfgContainer [2025-04-29 10:54:38,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:54:38,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:54:38,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:54:38,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:54:38,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:54:37" (1/3) ... [2025-04-29 10:54:38,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42785311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:54:38, skipping insertion in model container [2025-04-29 10:54:38,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:37" (2/3) ... [2025-04-29 10:54:38,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42785311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:54:38, skipping insertion in model container [2025-04-29 10:54:38,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:54:38" (3/3) ... [2025-04-29 10:54:38,029 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.c [2025-04-29 10:54:38,037 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:54:38,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_append_unequal.c that has 2 procedures, 34 locations, 49 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-29 10:54:38,075 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:54:38,083 INFO L340 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;@225a8153, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:54:38,084 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:54:38,086 INFO L278 IsEmpty]: Start isEmpty. Operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:54:38,090 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 10:54:38,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:38,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:38,091 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:38,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:38,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1926346031, now seen corresponding path program 1 times [2025-04-29 10:54:38,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:38,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139506843] [2025-04-29 10:54:38,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:38,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:38,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 10:54:38,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 10:54:38,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:38,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:54:38,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:38,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139506843] [2025-04-29 10:54:38,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139506843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:54:38,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:54:38,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:54:38,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461635155] [2025-04-29 10:54:38,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:54:38,476 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:54:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:38,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:54:38,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:54:38,493 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 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 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:54:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:38,528 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2025-04-29 10:54:38,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:54:38,530 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-04-29 10:54:38,531 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:38,535 INFO L225 Difference]: With dead ends: 60 [2025-04-29 10:54:38,535 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 10:54:38,537 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:54:38,540 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:38,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 75 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:54:38,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 10:54:38,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-29 10:54:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:54:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-04-29 10:54:38,565 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2025-04-29 10:54:38,566 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:38,566 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-04-29 10:54:38,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:54:38,566 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-04-29 10:54:38,567 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 10:54:38,567 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:38,567 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:38,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:54:38,567 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:38,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:38,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1822042565, now seen corresponding path program 1 times [2025-04-29 10:54:38,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:38,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780800248] [2025-04-29 10:54:38,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:38,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:38,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:54:38,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:54:38,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:38,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:54:38,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:38,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780800248] [2025-04-29 10:54:38,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780800248] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:38,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883322880] [2025-04-29 10:54:38,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:38,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:38,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:38,981 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:54:38,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 10:54:39,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:54:39,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:54:39,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:39,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:39,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 10:54:39,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:39,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-29 10:54:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:54:39,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:54:39,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883322880] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:54:39,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:54:39,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2025-04-29 10:54:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624604080] [2025-04-29 10:54:39,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:39,332 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 10:54:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:39,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 10:54:39,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-29 10:54:39,334 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-29 10:54:43,359 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:54:47,373 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:54:51,392 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:54:55,411 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:54:59,552 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:55:03,576 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:55:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:03,580 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2025-04-29 10:55:03,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 10:55:03,580 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2025-04-29 10:55:03,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:03,581 INFO L225 Difference]: With dead ends: 59 [2025-04-29 10:55:03,581 INFO L226 Difference]: Without dead ends: 36 [2025-04-29 10:55:03,581 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-04-29 10:55:03,582 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:03,582 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 232 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2025-04-29 10:55:03,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-29 10:55:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-04-29 10:55:03,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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) [2025-04-29 10:55:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-04-29 10:55:03,593 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 33 [2025-04-29 10:55:03,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:03,593 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-04-29 10:55:03,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-29 10:55:03,593 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-04-29 10:55:03,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 10:55:03,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:03,594 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:55:03,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:55:03,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:03,795 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:03,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:03,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1820195523, now seen corresponding path program 1 times [2025-04-29 10:55:03,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:03,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709465651] [2025-04-29 10:55:03,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:03,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:03,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:55:03,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:55:03,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:03,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:55:06,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:06,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709465651] [2025-04-29 10:55:06,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709465651] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:06,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655550523] [2025-04-29 10:55:06,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:06,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:06,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:06,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:55:06,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 10:55:06,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:55:06,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:55:06,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:06,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:06,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-04-29 10:55:06,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:06,637 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:55:06,834 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:55:06,898 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:55:06,898 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:55:06,966 INFO L354 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 [2025-04-29 10:55:07,031 INFO L354 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 [2025-04-29 10:55:07,164 INFO L354 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2025-04-29 10:55:07,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:07,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2025-04-29 10:55:07,186 INFO L354 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 11 [2025-04-29 10:55:07,194 INFO L354 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 56 treesize of output 21 [2025-04-29 10:55:07,197 INFO L354 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 12 treesize of output 1 [2025-04-29 10:55:07,331 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-29 10:55:07,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-29 10:55:07,339 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:55:07,539 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:55:07,540 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-29 10:55:07,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:07,551 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-04-29 10:55:07,566 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:55:07,567 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-04-29 10:55:07,729 INFO L354 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 [2025-04-29 10:55:07,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:07,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:07,734 INFO L354 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 [2025-04-29 10:55:07,738 INFO L354 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 [2025-04-29 10:55:07,804 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-29 10:55:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:55:07,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:07,977 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_452 Int) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_453 (Array Int 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#0| (select (select |c_#memory_$Pointer$#0.base| .cse1) .cse2) v_ArrVal_450) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_453))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_452)))) (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 [2025-04-29 10:55:07,986 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_452 Int) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_453 (Array Int 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#0| (select (select |c_#memory_$Pointer$#0.base| .cse1) .cse2) v_ArrVal_450) |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base| v_ArrVal_453))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_452)))) (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 [2025-04-29 10:55:08,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655550523] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:08,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:55:08,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2025-04-29 10:55:08,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194457940] [2025-04-29 10:55:08,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:55:08,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-29 10:55:08,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:08,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-29 10:55:08,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2117, Unknown=2, NotChecked=186, Total=2450 [2025-04-29 10:55:08,111 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 45 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 36 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:55:09,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:09,502 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2025-04-29 10:55:09,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 10:55:09,502 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 36 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2025-04-29 10:55:09,503 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:09,504 INFO L225 Difference]: With dead ends: 42 [2025-04-29 10:55:09,504 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 10:55:09,505 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=304, Invalid=4124, Unknown=2, NotChecked=262, Total=4692 [2025-04-29 10:55:09,506 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:09,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 355 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-29 10:55:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 10:55:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-04-29 10:55:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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) [2025-04-29 10:55:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-04-29 10:55:09,513 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 33 [2025-04-29 10:55:09,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:09,513 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-04-29 10:55:09,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 36 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:55:09,514 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-04-29 10:55:09,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:55:09,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:09,514 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:55:09,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 10:55:09,715 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-29 10:55:09,715 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:09,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:09,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1481786068, now seen corresponding path program 1 times [2025-04-29 10:55:09,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:09,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207529731] [2025-04-29 10:55:09,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:09,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:09,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:55:09,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:55:09,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:09,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:55:11,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:11,940 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207529731] [2025-04-29 10:55:11,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207529731] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:11,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706110625] [2025-04-29 10:55:11,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:11,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:11,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:11,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:55:11,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 10:55:12,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:55:12,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:55:12,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:12,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:12,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 166 conjuncts are in the unsatisfiable core [2025-04-29 10:55:12,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:12,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:55:12,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:55:12,400 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:55:12,401 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:55:12,417 INFO L354 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 [2025-04-29 10:55:12,483 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:55:12,489 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:55:12,505 INFO L354 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 [2025-04-29 10:55:12,586 INFO L354 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 [2025-04-29 10:55:12,594 INFO L354 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 [2025-04-29 10:55:12,604 INFO L354 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 [2025-04-29 10:55:12,730 INFO L325 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-04-29 10:55:12,730 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 96 [2025-04-29 10:55:12,734 INFO L354 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 67 treesize of output 18 [2025-04-29 10:55:12,750 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-04-29 10:55:12,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 10:55:12,891 INFO L354 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 [2025-04-29 10:55:12,894 INFO L354 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 [2025-04-29 10:55:12,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:55:12,900 INFO L354 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 [2025-04-29 10:55:13,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:13,086 INFO L354 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 [2025-04-29 10:55:13,097 INFO L325 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-04-29 10:55:13,098 INFO L354 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 [2025-04-29 10:55:13,114 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:55:13,114 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-04-29 10:55:13,134 INFO L354 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 [2025-04-29 10:55:13,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:13,357 INFO L325 Elim1Store]: treesize reduction 108, result has 7.7 percent of original size [2025-04-29 10:55:13,357 INFO L354 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 465 treesize of output 273 [2025-04-29 10:55:13,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:13,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:13,370 INFO L354 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 [2025-04-29 10:55:13,380 INFO L325 Elim1Store]: treesize reduction 77, result has 1.3 percent of original size [2025-04-29 10:55:13,381 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 109 [2025-04-29 10:55:13,387 INFO L354 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2025-04-29 10:55:13,393 INFO L354 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 79 treesize of output 73 [2025-04-29 10:55:13,404 INFO L354 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 53 treesize of output 19 [2025-04-29 10:55:13,414 INFO L354 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 [2025-04-29 10:55:13,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:13,426 INFO L354 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 348 treesize of output 239 [2025-04-29 10:55:13,433 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:55:13,433 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:55:13,434 WARN L181 Elim1Store]: Array PQE input equivalent to false [2025-04-29 10:55:13,601 INFO L354 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 101 treesize of output 61 [2025-04-29 10:55:13,604 INFO L354 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 47 treesize of output 23 [2025-04-29 10:55:13,607 INFO L354 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 15 treesize of output 7 [2025-04-29 10:55:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:55:13,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:13,762 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_690 Int) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (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 (select (select |c_#memory_$Pointer$#0.base| .cse1) .cse2)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (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#0| .cse0 (store (select |c_#memory_int#0| .cse0) (select (select |c_#memory_$Pointer$#0.offset| .cse1) .cse2) v_ArrVal_690)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_685) .cse1 v_ArrVal_693) (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_691))) (store (store .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_688) .cse1 (store (select (store .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse3 |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)) .cse1) .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse4) .cse5)) (+ (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_689) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_684))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse4) .cse5) 8)))))) is different from false [2025-04-29 10:55:13,786 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_690 Int) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (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 (select (select |c_#memory_$Pointer$#0.base| .cse1) .cse2)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (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#0| .cse0 (store (select |c_#memory_int#0| .cse0) (select (select |c_#memory_$Pointer$#0.offset| .cse1) .cse2) v_ArrVal_690)) |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base| v_ArrVal_685) .cse1 v_ArrVal_693) (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_691))) (store (store .cse3 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base| v_ArrVal_688) .cse1 (store (select (store .cse3 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.offset|) .cse0) |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.offset| .cse1)) .cse1) .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base|))) .cse4) .cse5)) (+ (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_689) |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base| v_ArrVal_684))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.offset|))) .cse4) .cse5) 8)))))) is different from false [2025-04-29 10:55:13,864 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_710 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_690 Int) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_685 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret6#1.base_18| Int) (v_ArrVal_684 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret6#1.base_18|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_append_#t~ret6#1.base_18| v_ArrVal_710)) (.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 (select (select .cse4 .cse1) .cse2)) (.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#0| .cse0 (store (select (store |c_#memory_int#0| |v_ULTIMATE.start_dll_circular_append_#t~ret6#1.base_18| v_ArrVal_708) .cse0) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret6#1.base_18| v_ArrVal_709) .cse1) .cse2) v_ArrVal_690)) |v_ULTIMATE.start_dll_circular_append_#t~ret6#1.base_18| v_ArrVal_685) .cse1 v_ArrVal_693) (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_691))) (store (store .cse3 |v_ULTIMATE.start_dll_circular_append_#t~ret6#1.base_18| v_ArrVal_688) .cse1 (store (select (store .cse3 |v_ULTIMATE.start_dll_circular_append_#t~ret6#1.base_18| (store (store (select (store .cse4 .cse0 v_ArrVal_691) |v_ULTIMATE.start_dll_circular_append_#t~ret6#1.base_18|) 4 .cse0) 0 .cse1)) .cse1) .cse2 |v_ULTIMATE.start_dll_circular_append_#t~ret6#1.base_18|))) .cse5) .cse6)) (+ 8 (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_689) |v_ULTIMATE.start_dll_circular_append_#t~ret6#1.base_18| v_ArrVal_684))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 0))) .cse5) .cse6)))))))) is different from false [2025-04-29 10:55:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706110625] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:13,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:55:13,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 44 [2025-04-29 10:55:13,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502895566] [2025-04-29 10:55:13,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:55:13,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-29 10:55:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:13,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-29 10:55:13,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1936, Unknown=3, NotChecked=270, Total=2352 [2025-04-29 10:55:13,868 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 44 states, 40 states have (on average 1.3) internal successors, (52), 35 states have internal predecessors, (52), 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) [2025-04-29 10:55:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:15,322 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2025-04-29 10:55:15,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 10:55:15,322 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.3) internal successors, (52), 35 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2025-04-29 10:55:15,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:15,323 INFO L225 Difference]: With dead ends: 68 [2025-04-29 10:55:15,323 INFO L226 Difference]: Without dead ends: 66 [2025-04-29 10:55:15,324 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=253, Invalid=3416, Unknown=3, NotChecked=360, Total=4032 [2025-04-29 10:55:15,325 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:15,325 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 309 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-29 10:55:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-29 10:55:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2025-04-29 10:55:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 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) [2025-04-29 10:55:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-04-29 10:55:15,331 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 36 [2025-04-29 10:55:15,331 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:15,331 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-04-29 10:55:15,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.3) internal successors, (52), 35 states have internal predecessors, (52), 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) [2025-04-29 10:55:15,332 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-04-29 10:55:15,332 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:55:15,332 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:15,332 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2025-04-29 10:55:15,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 10:55:15,533 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:15,533 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:15,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1481711606, now seen corresponding path program 1 times [2025-04-29 10:55:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:15,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877299002] [2025-04-29 10:55:15,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:15,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:55:15,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:55:15,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:15,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:55:16,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:16,578 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877299002] [2025-04-29 10:55:16,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877299002] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:16,578 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874433702] [2025-04-29 10:55:16,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:16,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:16,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:16,580 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:55:16,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 10:55:16,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:55:16,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:55:16,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:16,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:16,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-04-29 10:55:16,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:16,969 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:55:17,063 WARN L849 $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) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2025-04-29 10:55:17,065 WARN L871 $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) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2025-04-29 10:55:17,082 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:55:17,086 WARN L849 $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_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |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) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) is different from false [2025-04-29 10:55:17,088 WARN L871 $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_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |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) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) is different from true [2025-04-29 10:55:17,112 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 10:55:17,112 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 10:55:17,117 INFO L354 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 [2025-04-29 10:55:17,120 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |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) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from false [2025-04-29 10:55:17,122 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |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) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from true [2025-04-29 10:55:17,140 WARN L849 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |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) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2025-04-29 10:55:17,142 WARN L871 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |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) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2025-04-29 10:55:17,171 INFO L325 Elim1Store]: treesize reduction 57, result has 25.0 percent of original size [2025-04-29 10:55:17,171 INFO L354 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 2 case distinctions, treesize of input 83 treesize of output 35 [2025-04-29 10:55:17,192 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse2 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (or (= (select .cse2 0) .cse0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from false [2025-04-29 10:55:17,193 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse2 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (or (= (select .cse2 0) .cse0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from true [2025-04-29 10:55:17,218 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#0.base| .cse0))) (let ((.cse2 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 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|) (or (= (select .cse1 0) .cse2) (= .cse2 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))))))) is different from false [2025-04-29 10:55:17,220 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#0.base| .cse0))) (let ((.cse2 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 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|) (or (= (select .cse1 0) .cse2) (= .cse2 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))))))) is different from true [2025-04-29 10:55:17,232 INFO L354 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 49 treesize of output 17 [2025-04-29 10:55:17,252 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) is different from false [2025-04-29 10:55:17,254 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) is different from true [2025-04-29 10:55:17,278 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) is different from false [2025-04-29 10:55:17,280 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) is different from true [2025-04-29 10:55:17,319 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#0.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#0.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#0.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0))))) is different from false [2025-04-29 10:55:17,321 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#0.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#0.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#0.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0))))) is different from true [2025-04-29 10:55:17,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:17,358 INFO L354 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 57 treesize of output 34 [2025-04-29 10:55:17,395 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#0.base| .cse0))) (let ((.cse2 (select .cse5 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 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_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4))))))) (or (= (select .cse5 0) .cse2) (= .cse2 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.offset| 0))))) is different from false [2025-04-29 10:55:17,401 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#0.base| .cse0))) (let ((.cse2 (select .cse5 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 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_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4))))))) (or (= (select .cse5 0) .cse2) (= .cse2 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.offset| 0))))) is different from true [2025-04-29 10:55:17,440 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#0.base| .cse0))) (let ((.cse2 (select .cse5 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4))))))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (or (= (select .cse5 0) .cse2) (= .cse2 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-04-29 10:55:17,443 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#0.base| .cse0))) (let ((.cse2 (select .cse5 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4))))))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (or (= (select .cse5 0) .cse2) (= .cse2 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-04-29 10:55:17,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:17,483 INFO L325 Elim1Store]: treesize reduction 108, result has 7.7 percent of original size [2025-04-29 10:55:17,484 INFO L354 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 [2025-04-29 10:55:17,493 INFO L354 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 [2025-04-29 10:55:17,537 INFO L354 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 131 treesize of output 103 [2025-04-29 10:55:17,546 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-29 10:55:17,554 INFO L325 Elim1Store]: treesize reduction 79, result has 1.3 percent of original size [2025-04-29 10:55:17,554 INFO L354 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 193 treesize of output 125 [2025-04-29 10:55:17,562 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-29 10:55:17,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:17,570 INFO L354 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 207 treesize of output 146 [2025-04-29 10:55:17,574 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-29 10:55:17,588 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#0.base| .cse3))) (let ((.cse2 (select .cse8 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1))))))) (not (= .cse2 .cse3)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_5 4))) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| .cse2)) (.cse5 (store (store (store |c_#memory_$Pointer$#0.base| .cse2 v_DerPreprocessor_3) .cse6 v_DerPreprocessor_4) .cse3 v_DerPreprocessor_5))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= .cse4 (select .cse5 .cse2)) (= (select |v_old(#valid)_AFTER_CALL_12| .cse6) 0) (= (store .cse4 4 .cse6) v_DerPreprocessor_5) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select .cse8 4) .cse6) (= (select .cse5 .cse6) (select |c_#memory_$Pointer$#0.base| .cse6)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-04-29 10:55:17,591 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#0.base| .cse3))) (let ((.cse2 (select .cse8 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1))))))) (not (= .cse2 .cse3)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_5 4))) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| .cse2)) (.cse5 (store (store (store |c_#memory_$Pointer$#0.base| .cse2 v_DerPreprocessor_3) .cse6 v_DerPreprocessor_4) .cse3 v_DerPreprocessor_5))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= .cse4 (select .cse5 .cse2)) (= (select |v_old(#valid)_AFTER_CALL_12| .cse6) 0) (= (store .cse4 4 .cse6) v_DerPreprocessor_5) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select .cse8 4) .cse6) (= (select .cse5 .cse6) (select |c_#memory_$Pointer$#0.base| .cse6)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-04-29 10:55:17,652 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#0.base| .cse0))) (let ((.cse3 (select .cse8 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) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2))))))) (not (= .cse3 .cse0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_5 4))) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| .cse3)) (.cse5 (store (store (store |c_#memory_$Pointer$#0.base| .cse3 v_DerPreprocessor_3) .cse6 v_DerPreprocessor_4) .cse0 v_DerPreprocessor_5))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= .cse4 (select .cse5 .cse3)) (= (select |v_old(#valid)_AFTER_CALL_12| .cse6) 0) (= (store .cse4 4 .cse6) v_DerPreprocessor_5) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select .cse8 4) .cse6) (= (select .cse5 .cse6) (select |c_#memory_$Pointer$#0.base| .cse6)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-04-29 10:55:17,655 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#0.base| .cse0))) (let ((.cse3 (select .cse8 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) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2))))))) (not (= .cse3 .cse0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_5 4))) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| .cse3)) (.cse5 (store (store (store |c_#memory_$Pointer$#0.base| .cse3 v_DerPreprocessor_3) .cse6 v_DerPreprocessor_4) .cse0 v_DerPreprocessor_5))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= .cse4 (select .cse5 .cse3)) (= (select |v_old(#valid)_AFTER_CALL_12| .cse6) 0) (= (store .cse4 4 .cse6) v_DerPreprocessor_5) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select .cse8 4) .cse6) (= (select .cse5 .cse6) (select |c_#memory_$Pointer$#0.base| .cse6)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-04-29 10:55:17,736 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:17,736 INFO L354 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 [2025-04-29 10:55:17,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:17,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:17,746 INFO L325 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-04-29 10:55:17,746 INFO L354 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 276 treesize of output 185 [2025-04-29 10:55:17,762 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-29 10:55:17,763 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:55:17,768 INFO L354 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 [2025-04-29 10:55:17,784 WARN L849 $PredicateComparison]: unable to prove that (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (v_arrayElimCell_77 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_77) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_77) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0))) is different from false [2025-04-29 10:55:21,814 WARN L871 $PredicateComparison]: unable to prove that (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (v_arrayElimCell_77 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_77) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_77) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0))) is different from true [2025-04-29 10:55:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2025-04-29 10:55:21,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:22,003 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_914 (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$#0.base| .cse3) .cse5))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_913))) (store (store .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_914) .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|) (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse3)) .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 [2025-04-29 10:55:22,023 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_914 (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$#0.base| .cse3) .cse5))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_913))) (store (store .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base| v_ArrVal_914) .cse3 (store (select (store .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.offset|) .cse4) |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.offset| .cse3)) .cse3) .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret6#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 [2025-04-29 10:55:22,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874433702] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:22,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:55:22,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 40 [2025-04-29 10:55:22,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120333944] [2025-04-29 10:55:22,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:55:22,236 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-29 10:55:22,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:22,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-29 10:55:22,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=747, Unknown=30, NotChecked=1104, Total=1980 [2025-04-29 10:55:22,237 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 40 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 31 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:55:22,661 WARN L849 $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_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2025-04-29 10:55:22,665 WARN L871 $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_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2025-04-29 10:55:22,671 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.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) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (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 [2025-04-29 10:55:22,675 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.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) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (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 [2025-04-29 10:55:22,685 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (or .cse0 .cse1) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not .cse0))) is different from false [2025-04-29 10:55:22,689 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (or .cse0 .cse1) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not .cse0))) is different from true [2025-04-29 10:55:22,695 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and .cse0 (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2025-04-29 10:55:22,699 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and .cse0 (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from true [2025-04-29 10:55:22,718 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse2 (select .cse4 4))) (let ((.cse0 (select .cse4 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 1 (select |c_#valid| .cse0)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (not .cse1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (or (= .cse0 .cse2) .cse1))))) is different from false [2025-04-29 10:55:22,722 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse2 (select .cse4 4))) (let ((.cse0 (select .cse4 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 1 (select |c_#valid| .cse0)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (not .cse1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (or (= .cse0 .cse2) .cse1))))) is different from true [2025-04-29 10:55:22,762 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse1 0))) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| .cse2)) (.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|))) (let ((.cse0 (select |c_#memory_$Pointer$#0.base| .cse3)) (.cse5 (select .cse4 4)) (.cse6 (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) (not (= (select .cse0 4) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (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|) (= (select |c_#valid| (select .cse0 0)) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse3) 1) (or (= (select .cse4 0) .cse5) (= .cse5 .cse2)) (= (select .cse6 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 1) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |c_#valid| .cse7)))))) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2025-04-29 10:55:22,766 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse1 0))) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| .cse2)) (.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|))) (let ((.cse0 (select |c_#memory_$Pointer$#0.base| .cse3)) (.cse5 (select .cse4 4)) (.cse6 (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) (not (= (select .cse0 4) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (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|) (= (select |c_#valid| (select .cse0 0)) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse3) 1) (or (= (select .cse4 0) .cse5) (= .cse5 .cse2)) (= (select .cse6 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 1) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |c_#valid| .cse7)))))) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2025-04-29 10:55:22,820 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) is different from false [2025-04-29 10:55:22,825 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) is different from true [2025-04-29 10:55:22,834 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|))) (and (= (store |c_old(#memory_$Pointer$#0.base)| .cse0 (select |c_#memory_$Pointer$#0.base| .cse0)) |c_#memory_$Pointer$#0.base|) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#0.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#0.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#0.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0)))))) is different from false [2025-04-29 10:55:22,840 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|))) (and (= (store |c_old(#memory_$Pointer$#0.base)| .cse0 (select |c_#memory_$Pointer$#0.base| .cse0)) |c_#memory_$Pointer$#0.base|) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#0.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#0.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#0.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0)))))) is different from true [2025-04-29 10:55:22,854 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#0.base| .cse1)) (.cse6 (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|))) (let ((.cse0 (select |c_#memory_$Pointer$#0.base| .cse6)) (.cse3 (select .cse7 4))) (and (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base|)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 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|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (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_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5))))))) (not (= (select .cse0 4) .cse6)) (or (= (select .cse7 0) .cse3) (= .cse3 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.offset| 0))))) is different from false [2025-04-29 10:55:22,861 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#0.base| .cse1)) (.cse6 (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|))) (let ((.cse0 (select |c_#memory_$Pointer$#0.base| .cse6)) (.cse3 (select .cse7 4))) (and (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base|)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 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|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (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_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5))))))) (not (= (select .cse0 4) .cse6)) (or (= (select .cse7 0) .cse3) (= .cse3 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.offset| 0))))) is different from true [2025-04-29 10:55:22,931 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#0.base| .cse2)) (.cse0 (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|))) (let ((.cse1 (select |c_#memory_$Pointer$#0.base| .cse0)) (.cse4 (select .cse7 4)) (.cse8 (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) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)) (not (= (select .cse1 0) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 1))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (not (= (select .cse1 4) .cse0)) (or (= (select .cse7 0) .cse4) (= .cse4 .cse2)) (= (select .cse8 0) 0) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-04-29 10:55:22,938 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#0.base| .cse2)) (.cse0 (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|))) (let ((.cse1 (select |c_#memory_$Pointer$#0.base| .cse0)) (.cse4 (select .cse7 4)) (.cse8 (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) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)) (not (= (select .cse1 0) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 1))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (not (= (select .cse1 4) .cse0)) (or (= (select .cse7 0) .cse4) (= .cse4 .cse2)) (= (select .cse8 0) 0) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-04-29 10:55:22,969 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse10 0))) (let ((.cse8 (select |c_#memory_$Pointer$#0.base| .cse3))) (let ((.cse2 (select .cse8 0)) (.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1))))))) (not (= .cse2 .cse3)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_5 4))) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| .cse2)) (.cse5 (store (store (store |c_#memory_$Pointer$#0.base| .cse2 v_DerPreprocessor_3) .cse6 v_DerPreprocessor_4) .cse3 v_DerPreprocessor_5))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= .cse4 (select .cse5 .cse2)) (= (select |v_old(#valid)_AFTER_CALL_12| .cse6) 0) (= (store .cse4 4 .cse6) v_DerPreprocessor_5) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select .cse8 4) .cse6) (= (select .cse5 .cse6) (select |c_#memory_$Pointer$#0.base| .cse6)))))) (not (let ((.cse9 (select |c_#memory_$Pointer$#0.base| (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse9 4) (select .cse9 0)))) (= (select .cse11 0) 0) (= (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2025-04-29 10:55:22,975 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse10 0))) (let ((.cse8 (select |c_#memory_$Pointer$#0.base| .cse3))) (let ((.cse2 (select .cse8 0)) (.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1))))))) (not (= .cse2 .cse3)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_5 4))) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| .cse2)) (.cse5 (store (store (store |c_#memory_$Pointer$#0.base| .cse2 v_DerPreprocessor_3) .cse6 v_DerPreprocessor_4) .cse3 v_DerPreprocessor_5))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= .cse4 (select .cse5 .cse2)) (= (select |v_old(#valid)_AFTER_CALL_12| .cse6) 0) (= (store .cse4 4 .cse6) v_DerPreprocessor_5) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select .cse8 4) .cse6) (= (select .cse5 .cse6) (select |c_#memory_$Pointer$#0.base| .cse6)))))) (not (let ((.cse9 (select |c_#memory_$Pointer$#0.base| (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse9 4) (select .cse9 0)))) (= (select .cse11 0) 0) (= (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2025-04-29 10:55:23,060 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse10 0))) (let ((.cse8 (select |c_#memory_$Pointer$#0.base| .cse0))) (let ((.cse3 (select .cse8 0)) (.cse9 (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) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2))))))) (not (= .cse3 .cse0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_5 4))) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| .cse3)) (.cse5 (store (store (store |c_#memory_$Pointer$#0.base| .cse3 v_DerPreprocessor_3) .cse6 v_DerPreprocessor_4) .cse0 v_DerPreprocessor_5))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= .cse4 (select .cse5 .cse3)) (= (select |v_old(#valid)_AFTER_CALL_12| .cse6) 0) (= (store .cse4 4 .cse6) v_DerPreprocessor_5) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select .cse8 4) .cse6) (= (select .cse5 .cse6) (select |c_#memory_$Pointer$#0.base| .cse6)))))) (= (select .cse9 0) 0) (not (= (select (select |c_#memory_$Pointer$#0.base| (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2025-04-29 10:55:23,067 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse10 0))) (let ((.cse8 (select |c_#memory_$Pointer$#0.base| .cse0))) (let ((.cse3 (select .cse8 0)) (.cse9 (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) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_69 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2))))))) (not (= .cse3 .cse0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_5 4))) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| .cse3)) (.cse5 (store (store (store |c_#memory_$Pointer$#0.base| .cse3 v_DerPreprocessor_3) .cse6 v_DerPreprocessor_4) .cse0 v_DerPreprocessor_5))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= .cse4 (select .cse5 .cse3)) (= (select |v_old(#valid)_AFTER_CALL_12| .cse6) 0) (= (store .cse4 4 .cse6) v_DerPreprocessor_5) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select .cse8 4) .cse6) (= (select .cse5 .cse6) (select |c_#memory_$Pointer$#0.base| .cse6)))))) (= (select .cse9 0) 0) (not (= (select (select |c_#memory_$Pointer$#0.base| (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2025-04-29 10:55:23,103 WARN L849 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (v_arrayElimCell_77 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_77) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_77) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0)))) is different from false [2025-04-29 10:55:23,108 WARN L871 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (v_arrayElimCell_77 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_77) 1) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_77) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0)))) is different from true [2025-04-29 10:55:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:23,227 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-04-29 10:55:23,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 10:55:23,227 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 31 states have internal predecessors, (48), 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 36 [2025-04-29 10:55:23,228 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:23,228 INFO L225 Difference]: With dead ends: 73 [2025-04-29 10:55:23,228 INFO L226 Difference]: Without dead ends: 68 [2025-04-29 10:55:23,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=135, Invalid=855, Unknown=56, NotChecked=2494, Total=3540 [2025-04-29 10:55:23,229 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1194 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:23,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 281 Invalid, 0 Unknown, 1194 Unchecked, 0.7s Time] [2025-04-29 10:55:23,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-29 10:55:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-04-29 10:55:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:55:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2025-04-29 10:55:23,238 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 36 [2025-04-29 10:55:23,238 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:23,238 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2025-04-29 10:55:23,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 31 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:55:23,239 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2025-04-29 10:55:23,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:55:23,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:23,239 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2025-04-29 10:55:23,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 10:55:23,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:23,440 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:23,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1124311948, now seen corresponding path program 1 times [2025-04-29 10:55:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:23,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570179504] [2025-04-29 10:55:23,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:23,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:23,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:55:23,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:55:23,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:23,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:55:23,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:23,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570179504] [2025-04-29 10:55:23,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570179504] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:23,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890908749] [2025-04-29 10:55:23,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:23,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:23,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:23,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:55:23,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 10:55:23,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:55:23,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:55:23,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:23,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:23,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 10:55:23,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:55:23,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:55:23,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890908749] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:55:23,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:55:23,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-29 10:55:23,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357726379] [2025-04-29 10:55:23,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:55:23,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:55:23,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:23,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:55:23,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:55:23,829 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 10:55:23,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:23,894 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2025-04-29 10:55:23,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:55:23,895 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2025-04-29 10:55:23,895 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:23,896 INFO L225 Difference]: With dead ends: 98 [2025-04-29 10:55:23,896 INFO L226 Difference]: Without dead ends: 53 [2025-04-29 10:55:23,897 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:55:23,897 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:23,897 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:55:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-29 10:55:23,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-04-29 10:55:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 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) [2025-04-29 10:55:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-04-29 10:55:23,907 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 36 [2025-04-29 10:55:23,907 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:23,907 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-04-29 10:55:23,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 10:55:23,907 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-04-29 10:55:23,908 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 10:55:23,908 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:23,908 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:55:23,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 10:55:24,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:24,113 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:24,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:24,113 INFO L85 PathProgramCache]: Analyzing trace with hash -213955875, now seen corresponding path program 2 times [2025-04-29 10:55:24,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:24,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929965723] [2025-04-29 10:55:24,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:55:24,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:24,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-29 10:55:24,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 10:55:24,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:55:24,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:55:28,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:28,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929965723] [2025-04-29 10:55:28,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929965723] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:28,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269988551] [2025-04-29 10:55:28,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:55:28,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:28,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:28,408 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:55:28,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 10:55:28,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-29 10:55:28,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 10:55:28,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:55:28,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:28,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-04-29 10:55:28,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:28,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:55:29,293 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:55:29,293 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:55:29,438 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:55:29,457 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:55:29,587 INFO L354 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 [2025-04-29 10:55:29,609 INFO L354 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 [2025-04-29 10:55:29,872 INFO L325 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-04-29 10:55:29,872 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 73 [2025-04-29 10:55:29,883 INFO L354 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 67 treesize of output 18 [2025-04-29 10:55:30,361 INFO L354 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 49 treesize of output 17 [2025-04-29 10:55:30,369 INFO L354 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 [2025-04-29 10:55:30,376 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:55:31,078 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:55:31,078 INFO L354 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 31 treesize of output 28 [2025-04-29 10:55:31,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:31,113 INFO L354 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 57 treesize of output 34 [2025-04-29 10:55:31,179 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:55:31,179 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-04-29 10:55:31,888 INFO L325 Elim1Store]: treesize reduction 72, result has 27.3 percent of original size [2025-04-29 10:55:31,888 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 378 treesize of output 144 [2025-04-29 10:55:31,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:31,918 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 85 [2025-04-29 10:55:31,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:31,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:31,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:31,936 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54 [2025-04-29 10:55:31,943 INFO L354 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 [2025-04-29 10:55:33,235 INFO L354 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 149 treesize of output 97 [2025-04-29 10:55:33,299 INFO L325 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2025-04-29 10:55:33,299 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 83 treesize of output 41 [2025-04-29 10:55:33,309 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-04-29 10:55:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:55:33,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:34,791 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (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|)) (.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|) 4))) (let ((.cse21 (select (select |c_#memory_$Pointer$#0.base| .cse7) .cse8)) (.cse22 (select (select |c_#memory_$Pointer$#0.offset| .cse7) .cse8))) (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#memory_$Pointer$#0.base| .cse21 (store (select |c_#memory_$Pointer$#0.base| .cse21) .cse22 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (store .cse26 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse21) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse7))))) (store .cse25 .cse7 (store (select .cse25 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse23 (select .cse24 .cse10)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ .cse5 4)) (.cse11 (select .cse23 .cse5))) (let ((.cse0 (select .cse24 .cse11)) (.cse2 (select .cse23 .cse4)) (.cse9 (store |c_#memory_$Pointer$#0.offset| .cse21 (store (select |c_#memory_$Pointer$#0.offset| .cse21) .cse22 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (and (forall ((v_ArrVal_1312 (Array Int Int))) (let ((.cse3 (select (let ((.cse6 (store .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1312))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse10))) (let ((.cse1 (select .cse3 .cse5))) (or (= (select .cse0 .cse1) .cse2) (= (select .cse3 .cse4) .cse1))))) (or (= .cse11 .cse2) (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select .cse0 (select (select (let ((.cse12 (store .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1312))) (store .cse12 .cse7 (store (select .cse12 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse10) .cse5)) .cse2)) (forall ((v_ArrVal_1312 (Array Int Int))) (let ((.cse14 (let ((.cse15 (store .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1312))) (store .cse15 .cse7 (store (select .cse15 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))) (let ((.cse13 (select .cse14 .cse10))) (= (select .cse13 .cse4) (select (select .cse14 .cse11) (select .cse13 .cse5)))))))) (forall ((v_ArrVal_1312 (Array Int Int))) (let ((.cse17 (let ((.cse20 (store .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1312))) (store .cse20 .cse7 (store (select .cse20 .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))) (let ((.cse19 (select .cse17 .cse10))) (let ((.cse16 (select .cse19 .cse4)) (.cse18 (select .cse19 .cse5))) (or (= .cse16 (select (select .cse17 .cse11) .cse18)) (= .cse16 .cse18))))))))))))) is different from false Killed by 15