./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:58:44,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:58:44,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:58:44,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:58:44,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:58:44,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:58:44,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:58:44,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:58:44,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:58:44,906 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:58:44,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:58:44,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:58:44,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:58:44,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:58:44,908 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:58:44,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:58:44,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:58:44,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:58:44,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:58:44,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:58:44,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:58:44,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:58:44,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:58:44,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:58:44,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:58:44,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:58:44,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:58:44,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:58:44,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:58:44,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:58:44,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:58:44,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:58:44,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:58:44,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:58:44,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:58:44,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:58:44,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:58:44,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:58:44,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:58:44,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:58:44,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:58:44,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:58:44,917 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2024-11-08 13:58:45,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:58:45,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:58:45,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:58:45,206 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:58:45,207 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:58:45,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2024-11-08 13:58:46,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:58:46,934 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:58:46,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2024-11-08 13:58:46,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4798ff8fc/256df1cbd9294cb6a4d605b7b0485599/FLAG109654fbc [2024-11-08 13:58:46,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4798ff8fc/256df1cbd9294cb6a4d605b7b0485599 [2024-11-08 13:58:46,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:58:46,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:58:46,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:58:46,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:58:46,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:58:46,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:58:46" (1/1) ... [2024-11-08 13:58:46,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160ce63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:46, skipping insertion in model container [2024-11-08 13:58:46,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:58:46" (1/1) ... [2024-11-08 13:58:47,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:58:47,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2024-11-08 13:58:47,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:58:47,396 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:58:47,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2024-11-08 13:58:47,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:58:47,496 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:58:47,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47 WrapperNode [2024-11-08 13:58:47,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:58:47,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:58:47,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:58:47,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:58:47,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47" (1/1) ... [2024-11-08 13:58:47,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47" (1/1) ... [2024-11-08 13:58:47,554 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2024-11-08 13:58:47,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:58:47,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:58:47,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:58:47,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:58:47,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47" (1/1) ... [2024-11-08 13:58:47,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47" (1/1) ... [2024-11-08 13:58:47,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47" (1/1) ... [2024-11-08 13:58:47,599 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 10, 15]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 2, 7]. [2024-11-08 13:58:47,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47" (1/1) ... [2024-11-08 13:58:47,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47" (1/1) ... [2024-11-08 13:58:47,613 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47" (1/1) ... [2024-11-08 13:58:47,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47" (1/1) ... [2024-11-08 13:58:47,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47" (1/1) ... [2024-11-08 13:58:47,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47" (1/1) ... [2024-11-08 13:58:47,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:58:47,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:58:47,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:58:47,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:58:47,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47" (1/1) ... [2024-11-08 13:58:47,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:58:47,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:47,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:58:47,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:58:47,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:58:47,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:58:47,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:58:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:58:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:58:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:58:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-08 13:58:47,724 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-08 13:58:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:58:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:58:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:58:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:58:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:58:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:58:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:58:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:58:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:58:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:58:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:58:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:58:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:58:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:58:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:58:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:58:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:58:47,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:58:47,848 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:58:47,849 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:58:48,077 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-08 13:58:48,077 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:58:48,114 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:58:48,114 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-08 13:58:48,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:58:48 BoogieIcfgContainer [2024-11-08 13:58:48,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:58:48,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:58:48,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:58:48,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:58:48,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:58:46" (1/3) ... [2024-11-08 13:58:48,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ad1e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:58:48, skipping insertion in model container [2024-11-08 13:58:48,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:47" (2/3) ... [2024-11-08 13:58:48,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ad1e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:58:48, skipping insertion in model container [2024-11-08 13:58:48,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:58:48" (3/3) ... [2024-11-08 13:58:48,121 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2024-11-08 13:58:48,148 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:58:48,149 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:58:48,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:58:48,209 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10f1eb0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:58:48,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:58:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:58:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 13:58:48,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:48,226 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:48,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:48,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:48,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1454169709, now seen corresponding path program 1 times [2024-11-08 13:58:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176312691] [2024-11-08 13:58:48,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:48,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:48,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:58:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:58:48,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:48,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176312691] [2024-11-08 13:58:48,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176312691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:48,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:48,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:58:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123303202] [2024-11-08 13:58:48,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:48,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:58:48,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:48,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:58:48,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:58:48,621 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 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), 2 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:58:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:48,703 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2024-11-08 13:58:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:58:48,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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 [2024-11-08 13:58:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:48,712 INFO L225 Difference]: With dead ends: 67 [2024-11-08 13:58:48,712 INFO L226 Difference]: Without dead ends: 29 [2024-11-08 13:58:48,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:58:48,718 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:48,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:58:48,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-08 13:58:48,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-08 13:58:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:58:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-08 13:58:48,752 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2024-11-08 13:58:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:48,753 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-08 13:58:48,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:58:48,754 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-08 13:58:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 13:58:48,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:48,755 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:48,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:58:48,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:48,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1579182041, now seen corresponding path program 1 times [2024-11-08 13:58:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107031250] [2024-11-08 13:58:48,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:49,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:58:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:58:49,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:49,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107031250] [2024-11-08 13:58:49,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107031250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:49,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:49,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:58:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622504437] [2024-11-08 13:58:49,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:49,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:58:49,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:49,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:58:49,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:58:49,053 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:58:49,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:49,117 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2024-11-08 13:58:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:58:49,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-08 13:58:49,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:49,119 INFO L225 Difference]: With dead ends: 54 [2024-11-08 13:58:49,120 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 13:58:49,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:58:49,121 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:49,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:58:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 13:58:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-08 13:58:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:58:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-08 13:58:49,136 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 23 [2024-11-08 13:58:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:49,137 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-08 13:58:49,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:58:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-08 13:58:49,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 13:58:49,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:49,140 INFO L215 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] [2024-11-08 13:58:49,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:58:49,141 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:49,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:49,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1665445247, now seen corresponding path program 1 times [2024-11-08 13:58:49,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:49,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511957491] [2024-11-08 13:58:49,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:49,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:49,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:49,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:58:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:49,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:58:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:58:49,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:49,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511957491] [2024-11-08 13:58:49,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511957491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:49,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574629709] [2024-11-08 13:58:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:49,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:49,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:49,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:49,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:58:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:49,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 13:58:49,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:50,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-08 13:58:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:58:50,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:58:50,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574629709] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:58:50,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:58:50,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-11-08 13:58:50,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320756194] [2024-11-08 13:58:50,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:50,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 13:58:50,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:50,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 13:58:50,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-08 13:58:50,179 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:58:54,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:58:58,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:59:02,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:59:06,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:59:10,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:59:14,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:59:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:14,467 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-08 13:59:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 13:59:14,467 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2024-11-08 13:59:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:14,468 INFO L225 Difference]: With dead ends: 46 [2024-11-08 13:59:14,469 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 13:59:14,469 INFO L431 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 [2024-11-08 13:59:14,470 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:14,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 271 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2024-11-08 13:59:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 13:59:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-08 13:59:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:59:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-08 13:59:14,479 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 31 [2024-11-08 13:59:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:14,479 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-08 13:59:14,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:59:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-08 13:59:14,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 13:59:14,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:14,481 INFO L215 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] [2024-11-08 13:59:14,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 13:59:14,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:14,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:14,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1631242898, now seen corresponding path program 1 times [2024-11-08 13:59:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:14,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860396240] [2024-11-08 13:59:14,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:14,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:15,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:59:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:15,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:59:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:59:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:59:15,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:15,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860396240] [2024-11-08 13:59:15,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860396240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:15,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407924078] [2024-11-08 13:59:15,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:15,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:15,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:15,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:59:15,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 13:59:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:16,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-08 13:59:16,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:59:16,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:59:16,221 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:59:16,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 13:59:16,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:59:16,314 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:59:16,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-08 13:59:16,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-08 13:59:16,568 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2024-11-08 13:59:16,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2024-11-08 13:59:16,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:16,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 32 [2024-11-08 13:59:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:59:16,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:59:17,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407924078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:17,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:59:17,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 32 [2024-11-08 13:59:17,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507636729] [2024-11-08 13:59:17,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:59:17,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 13:59:17,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:17,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 13:59:17,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1231, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 13:59:17,250 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 32 states, 30 states have (on average 1.5) internal successors, (45), 25 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:59:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:18,450 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-11-08 13:59:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 13:59:18,451 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.5) internal successors, (45), 25 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 34 [2024-11-08 13:59:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:18,452 INFO L225 Difference]: With dead ends: 65 [2024-11-08 13:59:18,452 INFO L226 Difference]: Without dead ends: 55 [2024-11-08 13:59:18,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=210, Invalid=2340, Unknown=0, NotChecked=0, Total=2550 [2024-11-08 13:59:18,454 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:18,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 476 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 13:59:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-08 13:59:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-11-08 13:59:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:59:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-08 13:59:18,462 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 34 [2024-11-08 13:59:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:18,463 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-08 13:59:18,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.5) internal successors, (45), 25 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:59:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-08 13:59:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 13:59:18,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:18,464 INFO L215 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] [2024-11-08 13:59:18,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 13:59:18,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 13:59:18,669 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:18,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1471122359, now seen corresponding path program 1 times [2024-11-08 13:59:18,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:18,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988412393] [2024-11-08 13:59:18,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:18,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:19,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:59:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:20,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:59:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:20,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:59:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:59:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:20,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988412393] [2024-11-08 13:59:20,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988412393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:20,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565869869] [2024-11-08 13:59:20,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:20,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:20,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:20,315 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:59:20,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 13:59:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:20,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-08 13:59:20,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:59:20,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:59:20,722 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:59:20,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 13:59:20,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:59:20,838 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:59:20,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-08 13:59:20,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-11-08 13:59:20,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:59:21,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 13:59:21,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:59:21,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-11-08 13:59:21,153 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-08 13:59:21,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-08 13:59:21,497 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:59:21,504 INFO L349 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2024-11-08 13:59:21,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 22 [2024-11-08 13:59:21,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 40 [2024-11-08 13:59:21,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-08 13:59:21,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2024-11-08 13:59:21,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 13:59:21,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2024-11-08 13:59:21,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-08 13:59:21,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-08 13:59:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:59:21,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:59:21,757 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_662 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_661) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_662) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_661 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_661 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2024-11-08 13:59:21,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (or (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_662 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_661) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_662) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_661 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_661 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) (forall ((|ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| Int)) (not (= (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)))))) is different from false [2024-11-08 13:59:21,894 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (or (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_15| Int)) (not (= (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.base| .cse1) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_15|)))) (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_662 (Array Int Int))) (or (not (= v_ArrVal_661 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_661 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_661) .cse1 v_ArrVal_662) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2024-11-08 13:59:21,943 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (or (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_15| Int)) (not (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_15|)))) (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_662 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_661) .cse1 v_ArrVal_662) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_661 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_661 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))))))) is different from false [2024-11-08 13:59:21,967 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (or (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_662 (Array Int Int))) (or (not (= v_ArrVal_661 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_661 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_661) .cse0 v_ArrVal_662) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_15| Int)) (not (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_15|)))))))) is different from false [2024-11-08 13:59:22,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:22,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 524 treesize of output 514 [2024-11-08 13:59:22,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 71 [2024-11-08 13:59:22,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 274 [2024-11-08 13:59:22,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 325 treesize of output 277 [2024-11-08 13:59:22,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 13:59:22,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_15| Int) (v_ArrVal_668 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_18| Int)) (or (not (= (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_18| v_ArrVal_668))) (select .cse8 (select (select .cse8 .cse3) .cse4))) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_15|) .cse3)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_18|) 0)))))) (and (or (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset_17| Int)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset_17| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_18| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_15| Int) (v_ArrVal_668 (Array Int Int))) (not (= (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_18| v_ArrVal_668))) (select .cse2 (select (select .cse2 .cse3) .cse4))) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_15|) .cse3))) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_18| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_18|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_18|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_18| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_18|) 0)) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_15| Int) (v_ArrVal_668 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_18| v_ArrVal_668))) (let ((.cse6 (select (select .cse7 .cse3) .cse4))) (or (not (= .cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_18|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select .cse7 .cse6) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_15|) .cse3)))))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) .cse1))))) is different from false [2024-11-08 13:59:22,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565869869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:22,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:59:22,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2024-11-08 13:59:22,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287598345] [2024-11-08 13:59:22,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:59:22,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-08 13:59:22,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:22,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-08 13:59:22,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1871, Unknown=7, NotChecked=546, Total=2550 [2024-11-08 13:59:22,294 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 44 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 35 states have internal predecessors, (56), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 13:59:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:24,376 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2024-11-08 13:59:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-08 13:59:24,378 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 35 states have internal predecessors, (56), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2024-11-08 13:59:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:24,379 INFO L225 Difference]: With dead ends: 68 [2024-11-08 13:59:24,379 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 13:59:24,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=324, Invalid=4523, Unknown=7, NotChecked=846, Total=5700 [2024-11-08 13:59:24,385 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 49 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:24,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 501 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 13:59:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 13:59:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2024-11-08 13:59:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:59:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-11-08 13:59:24,405 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 36 [2024-11-08 13:59:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:24,406 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-11-08 13:59:24,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 35 states have internal predecessors, (56), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 13:59:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-11-08 13:59:24,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 13:59:24,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:24,407 INFO L215 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, 1, 1] [2024-11-08 13:59:24,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 13:59:24,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:24,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:24,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:24,612 INFO L85 PathProgramCache]: Analyzing trace with hash 704367666, now seen corresponding path program 1 times [2024-11-08 13:59:24,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998397754] [2024-11-08 13:59:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:24,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:26,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:59:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:26,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:59:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:26,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:59:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:59:26,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998397754] [2024-11-08 13:59:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998397754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745526768] [2024-11-08 13:59:26,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:26,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:26,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:26,881 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:59:26,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 13:59:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:27,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-08 13:59:27,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:59:27,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:59:27,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 13:59:27,373 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:59:27,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 13:59:27,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 13:59:27,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:59:27,514 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:59:27,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-08 13:59:27,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2024-11-08 13:59:27,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-11-08 13:59:27,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-08 13:59:27,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:59:27,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:59:27,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-11-08 13:59:27,874 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-08 13:59:27,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-08 13:59:27,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-08 13:59:28,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2024-11-08 13:59:28,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 170 [2024-11-08 13:59:28,530 INFO L349 Elim1Store]: treesize reduction 57, result has 10.9 percent of original size [2024-11-08 13:59:28,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 89 [2024-11-08 13:59:28,570 INFO L349 Elim1Store]: treesize reduction 88, result has 14.6 percent of original size [2024-11-08 13:59:28,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 306 treesize of output 173 [2024-11-08 13:59:28,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-08 13:59:28,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 186 [2024-11-08 13:59:28,602 INFO L349 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2024-11-08 13:59:28,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 224 [2024-11-08 13:59:28,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 37 [2024-11-08 13:59:28,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 97 [2024-11-08 13:59:28,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 65 [2024-11-08 13:59:28,766 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-08 13:59:28,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 32 [2024-11-08 13:59:28,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-08 13:59:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:59:28,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:59:29,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:29,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 102 [2024-11-08 13:59:29,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:29,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 207 [2024-11-08 13:59:29,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2024-11-08 13:59:29,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (not .cse7)) (.cse11 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0)) (.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse9 (+ (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4))) (and (or (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (and (or .cse1 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_856) .cse4) .cse5)) (+ 4 v_arrayElimCell_65))))) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int) (v_arrayElimCell_64 Int)) (let ((.cse6 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_856) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (+ 4 v_arrayElimCell_64))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (+ 4 v_arrayElimCell_65)))))) (or .cse7 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_64 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_856) .cse4) .cse5)) (+ 4 v_arrayElimCell_64))))))) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse8 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_856) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 .cse9)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ 4 v_arrayElimCell_65)))))) (or (not .cse11) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_856) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_65))))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int) (v_arrayElimCell_64 Int)) (let ((.cse12 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_856) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ 4 v_arrayElimCell_64))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ 4 v_arrayElimCell_65)))))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_64 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_856) .cse4) .cse5)) (+ 4 v_arrayElimCell_64))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse7) (or (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_856) .cse4) .cse5)) (+ 4 v_arrayElimCell_65))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse1) (or .cse11 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_856) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse9)))))))) is different from false [2024-11-08 13:59:43,985 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (or (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (= .cse2 .cse9)) (.cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse1 (+ (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse7 (= .cse5 .cse2)) (.cse11 (not .cse8)) (.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse0 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse5) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ 4 v_arrayElimCell_65))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1))))) (or (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse5) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1))) .cse7) (or (not .cse7) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse5) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_65))))) (or .cse8 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_64 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse9) .cse10)) (+ 4 v_arrayElimCell_64)))))) (or .cse11 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse9) .cse10)) (+ 4 v_arrayElimCell_65)))))) (or (and (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int) (v_arrayElimCell_64 Int)) (let ((.cse12 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse9) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ 4 v_arrayElimCell_64))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ 4 v_arrayElimCell_65)))))) (or .cse8 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_64 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse9) .cse10)) (+ 4 v_arrayElimCell_64))))) (or .cse11 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse9) .cse10)) (+ 4 v_arrayElimCell_65)))))) (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int) (v_arrayElimCell_64 Int)) (let ((.cse13 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse9) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ 4 v_arrayElimCell_64))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ 4 v_arrayElimCell_65)))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19| Int)) (not (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19|))))))) is different from false [2024-11-08 13:59:44,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse14 (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse14))) (or (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (= .cse2 .cse9))) (let ((.cse1 (+ .cse14 4)) (.cse11 (not .cse8)) (.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (= .cse2 .cse5)) (.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse0 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse5) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ 4 v_arrayElimCell_65)))))) (or .cse7 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse5) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1)))) (or .cse8 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_64 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse9) .cse10)) (+ 4 v_arrayElimCell_64)))))) (or (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse9) .cse10)) (+ 4 v_arrayElimCell_65))))) .cse11) (or (and (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int) (v_arrayElimCell_64 Int)) (let ((.cse12 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse9) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ 4 v_arrayElimCell_65))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ 4 v_arrayElimCell_64)))))) (or (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse9) .cse10)) (+ 4 v_arrayElimCell_65)))) .cse11) (or .cse8 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_64 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse9) .cse10)) (+ 4 v_arrayElimCell_64)))))) (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int) (v_arrayElimCell_64 Int)) (let ((.cse13 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse9) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ 4 v_arrayElimCell_65))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ 4 v_arrayElimCell_64)))))))) (or (not .cse7) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse5) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_65))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19| Int)) (not (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19|)))))))) is different from false [2024-11-08 13:59:44,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse14 (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse14))) (or (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (= .cse2 .cse5))) (let ((.cse10 (+ .cse14 4)) (.cse1 (not .cse7)) (.cse11 (= .cse0 .cse2)) (.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse0) (and (or .cse1 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse5) .cse6)) (+ 4 v_arrayElimCell_65))))) (or (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_64 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse5) .cse6)) (+ 4 v_arrayElimCell_64)))) .cse7) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int) (v_arrayElimCell_64 Int)) (let ((.cse8 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ 4 v_arrayElimCell_65))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ 4 v_arrayElimCell_64)))))))) (or (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse10))) .cse11) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse12 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 .cse10)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ 4 v_arrayElimCell_65)))))) (or .cse1 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse5) .cse6)) (+ 4 v_arrayElimCell_65)))))) (or (not .cse11) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_65))))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_65 Int) (v_arrayElimCell_64 Int)) (let ((.cse13 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ 4 v_arrayElimCell_65))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ 4 v_arrayElimCell_64)))))))) (or .cse7 (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_855 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_859 (Array Int Int)) (v_arrayElimCell_64 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_859) .cse2 v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_856) .cse5) .cse6)) (+ 4 v_arrayElimCell_64)))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19| Int)) (not (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19|)))))))) is different from false [2024-11-08 13:59:48,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745526768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:48,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:59:48,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2024-11-08 13:59:48,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793385494] [2024-11-08 13:59:48,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:59:48,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-08 13:59:48,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:48,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-08 13:59:48,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=3008, Unknown=37, NotChecked=452, Total=3660 [2024-11-08 13:59:48,447 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 51 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 42 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 13:59:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:51,986 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2024-11-08 13:59:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 13:59:51,986 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 42 states have internal predecessors, (62), 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 38 [2024-11-08 13:59:51,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:51,988 INFO L225 Difference]: With dead ends: 78 [2024-11-08 13:59:51,988 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 13:59:51,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=332, Invalid=5345, Unknown=39, NotChecked=604, Total=6320 [2024-11-08 13:59:51,990 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 60 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:51,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 474 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 13:59:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 13:59:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2024-11-08 13:59:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:59:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2024-11-08 13:59:52,001 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 38 [2024-11-08 13:59:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:52,001 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2024-11-08 13:59:52,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 42 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 13:59:52,002 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2024-11-08 13:59:52,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 13:59:52,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:52,003 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-08 13:59:52,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 13:59:52,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:52,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:52,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:52,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2080860260, now seen corresponding path program 2 times [2024-11-08 13:59:52,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:52,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751994688] [2024-11-08 13:59:52,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:52,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:53,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:59:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:53,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:59:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:53,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:59:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:59:53,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:53,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751994688] [2024-11-08 13:59:53,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751994688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:53,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079300053] [2024-11-08 13:59:53,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:59:53,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:53,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:53,723 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:59:53,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 13:59:53,879 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:59:53,880 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:59:53,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-08 13:59:53,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:59:53,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:59:54,028 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-11-08 13:59:54,031 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2024-11-08 13:59:54,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:59:54,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:59:54,066 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from false [2024-11-08 13:59:54,069 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from true [2024-11-08 13:59:54,115 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 13:59:54,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 34 [2024-11-08 13:59:54,132 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 13:59:54,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2024-11-08 13:59:54,150 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1))) is different from false [2024-11-08 13:59:54,152 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1))) is different from true [2024-11-08 13:59:54,182 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |c_#valid| .cse2))))))))) is different from false [2024-11-08 13:59:54,185 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |c_#valid| .cse2))))))))) is different from true [2024-11-08 13:59:54,203 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 13:59:54,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2024-11-08 13:59:54,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:59:54,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-08 13:59:54,245 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-08 13:59:54,248 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-08 13:59:54,277 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-08 13:59:54,280 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-08 13:59:54,338 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_40| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_40|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_40|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_40|) 0))) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1))))) is different from false [2024-11-08 13:59:54,342 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_40| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_40|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_40|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_40|) 0))) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1))))) is different from true [2024-11-08 13:59:54,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:59:54,398 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 13:59:54,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2024-11-08 13:59:54,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:59:54,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:59:54,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:59:54,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-08 13:59:54,464 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1))) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))))) is different from false [2024-11-08 13:59:54,469 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1))) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))))) is different from true [2024-11-08 13:59:54,587 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1))) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))))) is different from false [2024-11-08 13:59:54,591 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1))) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))))) is different from true [2024-11-08 13:59:54,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))))) is different from false [2024-11-08 13:59:54,707 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))))) is different from true [2024-11-08 13:59:54,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))))) is different from false [2024-11-08 13:59:54,790 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))))) is different from true [2024-11-08 13:59:54,794 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2024-11-08 13:59:54,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:59:55,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079300053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:55,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:59:55,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2024-11-08 13:59:55,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960499117] [2024-11-08 13:59:55,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:59:55,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 13:59:55,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:55,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 13:59:55,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=691, Unknown=22, NotChecked=682, Total=1482 [2024-11-08 13:59:55,327 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 32 states, 30 states have (on average 1.6) internal successors, (48), 26 states have internal predecessors, (48), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:59:55,499 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-11-08 13:59:55,502 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2024-11-08 13:59:55,505 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from false [2024-11-08 13:59:55,507 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from true [2024-11-08 13:59:55,514 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1))) is different from false [2024-11-08 13:59:55,516 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1))) is different from true [2024-11-08 13:59:55,523 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse1 (select .cse5 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse2 .cse3) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse3) (= (select .cse0 .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select .cse5 .cse4)) 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |c_#valid| .cse6))))))))))) is different from false [2024-11-08 13:59:55,526 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse1 (select .cse5 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse2 .cse3) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse3) (= (select .cse0 .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select .cse5 .cse4)) 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |c_#valid| .cse6))))))))))) is different from true [2024-11-08 13:59:55,529 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-08 13:59:55,532 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-08 13:59:55,536 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-08 13:59:55,538 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-08 13:59:55,550 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (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$#2.offset)| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse2) 0)) (exists ((|v_node_create_~temp~0#1.base_40| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_40|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_40|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_40|) 0))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1)))))) is different from false [2024-11-08 13:59:55,554 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (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$#2.offset)| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse2) 0)) (exists ((|v_node_create_~temp~0#1.base_40| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_40|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_40|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_40|) 0))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1)))))) is different from true [2024-11-08 13:59:55,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| .cse3)) (.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse2 (select .cse10 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select .cse10 .cse9)) (.cse5 (select .cse1 .cse9))) (and (= .cse0 0) (= (select .cse1 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4)))) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1))) (= .cse0 .cse5) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse5) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse5)) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1)))))))) is different from false [2024-11-08 13:59:55,569 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| .cse3)) (.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse2 (select .cse10 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select .cse10 .cse9)) (.cse5 (select .cse1 .cse9))) (and (= .cse0 0) (= (select .cse1 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4)))) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1))) (= .cse0 .cse5) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse5) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse5)) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1)))))))) is different from true [2024-11-08 13:59:55,580 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (and (= .cse0 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0) 0) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse3) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse5 (select |v_old(#valid)_AFTER_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1))) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1)))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse2 .cse8) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3) .cse8)))))) is different from false [2024-11-08 13:59:55,583 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (and (= .cse0 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0) 0) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse3) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse5 (select |v_old(#valid)_AFTER_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1))) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1)))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse2 .cse8) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3) .cse8)))))) is different from true [2024-11-08 13:59:55,593 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (and (= .cse0 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0) 0) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse5 (select |v_old(#valid)_AFTER_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1))) (let ((.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and .cse6 (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) (and .cse6 (= (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1))))))) is different from false [2024-11-08 13:59:55,596 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (and (= .cse0 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0) 0) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse5 (select |v_old(#valid)_AFTER_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1))) (let ((.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and .cse6 (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) (and .cse6 (= (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1))))))) is different from true [2024-11-08 13:59:55,606 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= .cse0 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) (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$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))))) is different from false [2024-11-08 13:59:55,609 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= .cse0 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) (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$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))))) is different from true [2024-11-08 13:59:55,620 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))))) is different from false [2024-11-08 13:59:55,623 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))))) is different from true [2024-11-08 13:59:55,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:55,720 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2024-11-08 13:59:55,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 13:59:55,720 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.6) internal successors, (48), 26 states have internal predecessors, (48), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2024-11-08 13:59:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:55,721 INFO L225 Difference]: With dead ends: 76 [2024-11-08 13:59:55,721 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 13:59:55,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=122, Invalid=794, Unknown=46, NotChecked=1794, Total=2756 [2024-11-08 13:59:55,722 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 906 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:55,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 201 Invalid, 0 Unknown, 906 Unchecked, 0.2s Time] [2024-11-08 13:59:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 13:59:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-08 13:59:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:59:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-11-08 13:59:55,732 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 38 [2024-11-08 13:59:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:55,732 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-11-08 13:59:55,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.6) internal successors, (48), 26 states have internal predecessors, (48), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:59:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-11-08 13:59:55,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 13:59:55,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:55,734 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-08 13:59:55,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 13:59:55,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:55,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:55,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1392203254, now seen corresponding path program 1 times [2024-11-08 13:59:55,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:55,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397102568] [2024-11-08 13:59:55,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:55,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:57,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:59:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:57,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:59:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:57,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:59:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:59:57,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:57,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397102568] [2024-11-08 13:59:57,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397102568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:57,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715712100] [2024-11-08 13:59:57,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:57,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:57,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:57,815 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:59:57,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 13:59:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:57,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 139 conjuncts are in the unsatisfiable core [2024-11-08 13:59:57,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:59:58,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:59:58,235 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:59:58,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 13:59:58,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:59:58,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:59:58,367 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:59:58,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-08 13:59:58,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-08 13:59:58,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-08 13:59:58,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:59:58,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 13:59:58,774 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 13:59:58,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-08 13:59:58,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:59:58,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-08 13:59:58,811 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 13:59:58,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-08 13:59:59,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2024-11-08 13:59:59,620 INFO L349 Elim1Store]: treesize reduction 84, result has 29.4 percent of original size [2024-11-08 13:59:59,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 102 [2024-11-08 13:59:59,658 INFO L349 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2024-11-08 13:59:59,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 138 treesize of output 100 [2024-11-08 13:59:59,695 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-08 13:59:59,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 107 [2024-11-08 13:59:59,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 83 [2024-11-08 13:59:59,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 41 [2024-11-08 13:59:59,755 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-08 13:59:59,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-08 13:59:59,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 117 [2024-11-08 14:00:00,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2024-11-08 14:00:00,257 INFO L349 Elim1Store]: treesize reduction 68, result has 41.9 percent of original size [2024-11-08 14:00:00,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 172 treesize of output 110 [2024-11-08 14:00:00,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-08 14:00:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:00:00,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:00,638 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1246 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1244 (Array Int Int))) (not (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse1 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1244))) (select .cse1 (select (select .cse1 .cse0) .cse2))) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1246) .cse0) .cse2))))))))) is different from false [2024-11-08 14:00:01,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715712100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:01,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:01,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 46 [2024-11-08 14:00:01,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708470165] [2024-11-08 14:00:01,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:01,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-08 14:00:01,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:01,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-08 14:00:01,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2809, Unknown=1, NotChecked=106, Total=3080 [2024-11-08 14:00:01,568 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 46 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 38 states have internal predecessors, (63), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 14:00:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:04,378 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2024-11-08 14:00:04,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-08 14:00:04,379 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 38 states have internal predecessors, (63), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2024-11-08 14:00:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:04,381 INFO L225 Difference]: With dead ends: 101 [2024-11-08 14:00:04,381 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 14:00:04,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=386, Invalid=6259, Unknown=1, NotChecked=160, Total=6806 [2024-11-08 14:00:04,383 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 76 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:04,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 448 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 14:00:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 14:00:04,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. [2024-11-08 14:00:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 14:00:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2024-11-08 14:00:04,396 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 41 [2024-11-08 14:00:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:04,396 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2024-11-08 14:00:04,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 38 states have internal predecessors, (63), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 14:00:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2024-11-08 14:00:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 14:00:04,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:04,398 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:04,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 14:00:04,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:04,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:04,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash -208586744, now seen corresponding path program 1 times [2024-11-08 14:00:04,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:04,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944009665] [2024-11-08 14:00:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:04,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:07,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:00:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:07,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 14:00:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:07,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 14:00:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:07,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:07,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944009665] [2024-11-08 14:00:07,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944009665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:07,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299840670] [2024-11-08 14:00:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:07,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:07,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:07,657 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:00:07,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 14:00:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:07,833 WARN L253 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 188 conjuncts are in the unsatisfiable core [2024-11-08 14:00:07,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:07,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 14:00:07,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 14:00:08,223 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 14:00:08,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-08 14:00:08,245 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 14:00:08,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 14:00:08,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 14:00:08,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 14:00:08,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 14:00:08,507 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 14:00:08,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 75 [2024-11-08 14:00:08,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-08 14:00:08,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:08,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-08 14:00:08,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-11-08 14:00:08,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 14:00:08,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 14:00:08,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 14:00:09,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:09,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 39 [2024-11-08 14:00:09,287 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-08 14:00:09,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2024-11-08 14:00:09,320 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 14:00:09,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-08 14:00:09,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 14:00:10,684 INFO L349 Elim1Store]: treesize reduction 24, result has 53.8 percent of original size [2024-11-08 14:00:10,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 426 treesize of output 317 [2024-11-08 14:00:10,725 INFO L349 Elim1Store]: treesize reduction 82, result has 15.5 percent of original size [2024-11-08 14:00:10,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 275 treesize of output 151 [2024-11-08 14:00:10,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:10,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 52 [2024-11-08 14:00:10,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:10,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:10,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 51 [2024-11-08 14:00:10,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2024-11-08 14:00:10,771 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 14:00:10,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-08 14:00:11,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 14:00:11,695 INFO L349 Elim1Store]: treesize reduction 134, result has 7.6 percent of original size [2024-11-08 14:00:11,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 174 treesize of output 97 [2024-11-08 14:00:11,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:11,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:11,704 INFO L378 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 26 treesize of output 10