./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 3061b6dc 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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:09:44,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:09:44,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:09:44,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:09:44,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:09:44,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:09:44,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:09:44,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:09:44,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:09:44,722 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:09:44,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:09:44,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:09:44,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:09:44,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:09:44,724 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:09:44,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:09:44,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:09:44,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:09:44,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:09:44,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:09:44,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:09:44,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:09:44,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:09:44,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:09:44,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:09:44,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:09:44,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:09:44,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:09:44,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:09:44,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:09:44,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:09:44,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:09:44,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:09:44,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:09:44,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:09:44,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:09:44,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:09:44,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:09:44,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:09:44,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:09:44,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:09:44,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:09:44,738 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-18 13:09:45,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:09:45,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:09:45,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:09:45,037 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:09:45,038 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:09:45,039 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-18 13:09:46,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:09:46,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:09:46,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2024-11-18 13:09:46,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ef9dcda/68563c5d8b274529accce38638db55d9/FLAGbe10c9e3b [2024-11-18 13:09:47,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ef9dcda/68563c5d8b274529accce38638db55d9 [2024-11-18 13:09:47,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:09:47,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:09:47,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:09:47,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:09:47,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:09:47,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1772b17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47, skipping insertion in model container [2024-11-18 13:09:47,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:09:47,482 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-18 13:09:47,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:09:47,498 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:09:47,547 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-18 13:09:47,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:09:47,585 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:09:47,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47 WrapperNode [2024-11-18 13:09:47,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:09:47,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:09:47,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:09:47,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:09:47,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,629 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2024-11-18 13:09:47,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:09:47,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:09:47,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:09:47,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:09:47,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,677 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-18 13:09:47,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,690 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:09:47,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:09:47,707 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:09:47,707 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:09:47,708 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47" (1/1) ... [2024-11-18 13:09:47,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:09:47,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:47,743 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-18 13:09:47,747 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-18 13:09:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:09:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:09:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 13:09:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:09:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:09:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 13:09:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-18 13:09:47,793 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-18 13:09:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:09:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:09:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 13:09:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:09:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:09:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-18 13:09:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:09:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:09:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-18 13:09:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 13:09:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-18 13:09:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-18 13:09:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-18 13:09:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:09:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:09:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 13:09:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:09:47,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:09:47,927 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:09:47,929 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:09:48,245 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-18 13:09:48,245 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:09:48,258 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:09:48,259 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 13:09:48,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:09:48 BoogieIcfgContainer [2024-11-18 13:09:48,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:09:48,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:09:48,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:09:48,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:09:48,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:09:47" (1/3) ... [2024-11-18 13:09:48,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fe1f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:09:48, skipping insertion in model container [2024-11-18 13:09:48,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:47" (2/3) ... [2024-11-18 13:09:48,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fe1f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:09:48, skipping insertion in model container [2024-11-18 13:09:48,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:09:48" (3/3) ... [2024-11-18 13:09:48,268 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2024-11-18 13:09:48,286 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:09:48,286 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:09:48,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:09:48,344 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;@d4cd2aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:09:48,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:09:48,349 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-18 13:09:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 13:09:48,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:48,359 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-18 13:09:48,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:48,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1454169709, now seen corresponding path program 1 times [2024-11-18 13:09:48,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:48,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668518174] [2024-11-18 13:09:48,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:48,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:48,681 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-18 13:09:48,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:48,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668518174] [2024-11-18 13:09:48,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668518174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:09:48,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:09:48,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:09:48,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735597260] [2024-11-18 13:09:48,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:09:48,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:09:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:48,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:09:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:09:48,720 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 2 states, 2 states have (on average 7.5) 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-18 13:09:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:48,742 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2024-11-18 13:09:48,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:09:48,745 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) 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-18 13:09:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:48,750 INFO L225 Difference]: With dead ends: 67 [2024-11-18 13:09:48,751 INFO L226 Difference]: Without dead ends: 29 [2024-11-18 13:09:48,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:09:48,758 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:48,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:09:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-18 13:09:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-18 13:09:48,794 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-18 13:09:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-18 13:09:48,798 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2024-11-18 13:09:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:48,800 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-18 13:09:48,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) 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-18 13:09:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-18 13:09:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 13:09:48,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:48,801 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-18 13:09:48,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:09:48,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:48,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:48,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1579182041, now seen corresponding path program 1 times [2024-11-18 13:09:48,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:48,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173339632] [2024-11-18 13:09:48,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:49,048 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-18 13:09:49,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:49,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173339632] [2024-11-18 13:09:49,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173339632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:09:49,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:09:49,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:09:49,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793772510] [2024-11-18 13:09:49,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:09:49,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:09:49,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:49,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:09:49,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:09:49,055 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 13:09:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:49,077 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2024-11-18 13:09:49,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:09:49,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-18 13:09:49,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:49,080 INFO L225 Difference]: With dead ends: 54 [2024-11-18 13:09:49,080 INFO L226 Difference]: Without dead ends: 32 [2024-11-18 13:09:49,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:09:49,083 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:49,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:09:49,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-18 13:09:49,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-18 13:09:49,092 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-18 13:09:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-18 13:09:49,094 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 23 [2024-11-18 13:09:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:49,095 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-18 13:09:49,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-18 13:09:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-18 13:09:49,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-18 13:09:49,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:49,097 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-18 13:09:49,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:09:49,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:49,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:49,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1665445247, now seen corresponding path program 1 times [2024-11-18 13:09:49,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:49,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422977304] [2024-11-18 13:09:49,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:49,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:49,628 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-18 13:09:49,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422977304] [2024-11-18 13:09:49,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422977304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581480903] [2024-11-18 13:09:49,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:49,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:49,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:49,632 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-18 13:09:49,634 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-18 13:09:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:49,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-18 13:09:49,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:50,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-18 13:09:50,015 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-18 13:09:50,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:50,078 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-18 13:09:50,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581480903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:09:50,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:09:50,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2024-11-18 13:09:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691449463] [2024-11-18 13:09:50,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:09:50,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 13:09:50,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:50,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 13:09:50,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-18 13:09:50,081 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:09:54,112 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-18 13:09:58,135 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-18 13:10:02,145 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-18 13:10:06,242 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-18 13:10:10,283 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-18 13:10:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:10,292 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-18 13:10:10,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 13:10:10,293 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2024-11-18 13:10:10,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:10,294 INFO L225 Difference]: With dead ends: 46 [2024-11-18 13:10:10,294 INFO L226 Difference]: Without dead ends: 37 [2024-11-18 13:10:10,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-18 13:10:10,295 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:10,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 272 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2024-11-18 13:10:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-18 13:10:10,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-18 13:10:10,303 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-18 13:10:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-18 13:10:10,304 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 31 [2024-11-18 13:10:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:10,304 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-18 13:10:10,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:10:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-18 13:10:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-18 13:10:10,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:10,306 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-18 13:10:10,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 13:10:10,506 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-18 13:10:10,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:10,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1631242898, now seen corresponding path program 1 times [2024-11-18 13:10:10,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:10,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550986784] [2024-11-18 13:10:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:10,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:10:11,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:11,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550986784] [2024-11-18 13:10:11,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550986784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:11,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537671713] [2024-11-18 13:10:11,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:11,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:11,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:11,710 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-18 13:10:11,712 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-18 13:10:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:11,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-18 13:10:11,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:11,886 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-18 13:10:12,004 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-18 13:10:12,005 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-18 13:10:12,042 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-18 13:10:12,103 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:10:12,103 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-18 13:10:12,201 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-18 13:10:12,437 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2024-11-18 13:10:12,438 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-18 13:10:12,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:10:12,750 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-18 13:10:12,820 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-18 13:10:12,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:13,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537671713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:13,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:10:13,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 32 [2024-11-18 13:10:13,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956341] [2024-11-18 13:10:13,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:13,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-18 13:10:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:13,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-18 13:10:13,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1231, Unknown=0, NotChecked=0, Total=1332 [2024-11-18 13:10:13,089 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 32 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 25 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-18 13:10:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:14,185 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-11-18 13:10:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 13:10:14,186 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 25 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 34 [2024-11-18 13:10:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:14,187 INFO L225 Difference]: With dead ends: 65 [2024-11-18 13:10:14,187 INFO L226 Difference]: Without dead ends: 55 [2024-11-18 13:10:14,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=210, Invalid=2340, Unknown=0, NotChecked=0, Total=2550 [2024-11-18 13:10:14,191 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:14,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 491 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 13:10:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-18 13:10:14,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-11-18 13:10:14,205 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-18 13:10:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-18 13:10:14,206 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 34 [2024-11-18 13:10:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:14,206 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-18 13:10:14,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 25 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-18 13:10:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-18 13:10:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-18 13:10:14,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:14,207 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-18 13:10:14,226 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-18 13:10:14,408 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-18 13:10:14,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:14,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:14,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1471122359, now seen corresponding path program 1 times [2024-11-18 13:10:14,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:14,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859683960] [2024-11-18 13:10:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:14,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:16,287 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-18 13:10:16,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:16,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859683960] [2024-11-18 13:10:16,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859683960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:16,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731813463] [2024-11-18 13:10:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:16,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:16,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:16,290 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-18 13:10:16,292 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-18 13:10:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:16,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 135 conjuncts are in the unsatisfiable core [2024-11-18 13:10:16,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:16,467 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-18 13:10:16,615 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:10:16,615 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-18 13:10:16,672 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-18 13:10:16,727 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-18 13:10:16,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2024-11-18 13:10:16,875 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-18 13:10:17,005 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-18 13:10:17,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-18 13:10:17,154 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:10:17,154 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-18 13:10:17,200 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-18 13:10:17,201 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 20 treesize of output 22 [2024-11-18 13:10:17,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:10:17,586 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:10:17,612 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2024-11-18 13:10:17,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:10:17,716 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 15 treesize of output 15 [2024-11-18 13:10:17,916 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 59 treesize of output 26 [2024-11-18 13:10:17,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-11-18 13:10:17,959 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-18 13:10:17,959 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 44 treesize of output 44 [2024-11-18 13:10:17,981 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-18 13:10:17,982 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-18 13:10:18,019 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 23 treesize of output 15 [2024-11-18 13:10:18,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-18 13:10:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:10:18,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:18,081 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_511) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_509) (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)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_511 (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_511 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2024-11-18 13:10:18,325 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (or (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_511) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| v_ArrVal_509) (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)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_511 (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_511 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (not (= (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) (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|))))))) is different from false [2024-11-18 13:10:18,363 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (or (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_511) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| v_ArrVal_509) (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 .cse1 |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)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (let ((.cse2 (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) (select (select |c_#memory_$Pointer$#2.offset| .cse2) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) (not (= v_ArrVal_511 (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_511 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) is different from false [2024-11-18 13:10:18,386 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (or (not (= (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_511 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) v_ArrVal_511)) (= |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_511) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| v_ArrVal_509) (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_#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 .cse1 |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|)))) (not (let ((.cse2 (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) (select (select |c_#memory_$Pointer$#2.offset| .cse2) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))))))) is different from false [2024-11-18 13:10:18,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:10:18,470 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 206 treesize of output 210 [2024-11-18 13:10:18,486 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 184 treesize of output 152 [2024-11-18 13:10:18,496 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 195 treesize of output 176 [2024-11-18 13:10:18,575 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 265 treesize of output 233 [2024-11-18 13:10:18,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731813463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:18,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:10:18,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 39 [2024-11-18 13:10:18,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650549801] [2024-11-18 13:10:18,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:18,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-18 13:10:18,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:18,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-18 13:10:18,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1685, Unknown=5, NotChecked=340, Total=2162 [2024-11-18 13:10:18,843 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 39 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 31 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-18 13:10:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:20,637 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2024-11-18 13:10:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-18 13:10:20,640 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 31 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2024-11-18 13:10:20,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:20,641 INFO L225 Difference]: With dead ends: 60 [2024-11-18 13:10:20,641 INFO L226 Difference]: Without dead ends: 58 [2024-11-18 13:10:20,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=271, Invalid=2932, Unknown=5, NotChecked=452, Total=3660 [2024-11-18 13:10:20,643 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:20,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 420 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 13:10:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-18 13:10:20,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-11-18 13:10:20,659 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-18 13:10:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-11-18 13:10:20,661 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 36 [2024-11-18 13:10:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:20,662 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-11-18 13:10:20,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 31 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-18 13:10:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-11-18 13:10:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 13:10:20,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:20,663 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-18 13:10:20,684 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-18 13:10:20,863 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-18 13:10:20,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:20,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:20,865 INFO L85 PathProgramCache]: Analyzing trace with hash 704367666, now seen corresponding path program 1 times [2024-11-18 13:10:20,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:20,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251613865] [2024-11-18 13:10:20,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:20,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:23,103 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-18 13:10:23,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:23,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251613865] [2024-11-18 13:10:23,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251613865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:23,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442150939] [2024-11-18 13:10:23,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:23,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:23,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:23,105 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-18 13:10:23,106 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-18 13:10:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:23,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 149 conjuncts are in the unsatisfiable core [2024-11-18 13:10:23,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:23,303 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-18 13:10:23,450 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-18 13:10:23,517 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:10:23,517 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-18 13:10:23,572 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-18 13:10:23,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-18 13:10:23,583 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-18 13:10:23,677 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:10:23,677 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 66 treesize of output 57 [2024-11-18 13:10:23,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-18 13:10:23,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-18 13:10:23,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-18 13:10:23,832 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-18 13:10:23,836 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-18 13:10:23,844 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-18 13:10:24,095 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:10:24,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-18 13:10:24,112 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:10:24,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-18 13:10:24,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:24,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-11-18 13:10:24,151 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-18 13:10:24,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-18 13:10:25,010 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-18 13:10:25,016 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 49 treesize of output 15 [2024-11-18 13:10:25,033 INFO L349 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2024-11-18 13:10:25,033 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 124 treesize of output 80 [2024-11-18 13:10:25,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 101 [2024-11-18 13:10:25,059 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2024-11-18 13:10:25,059 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 230 treesize of output 123 [2024-11-18 13:10:25,070 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 75 treesize of output 41 [2024-11-18 13:10:25,076 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-18 13:10:25,091 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-18 13:10:25,091 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-18 13:10:25,156 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 137 treesize of output 97 [2024-11-18 13:10:25,160 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 69 [2024-11-18 13:10:25,259 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-18 13:10:25,260 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 66 treesize of output 33 [2024-11-18 13:10:25,263 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 15 treesize of output 7 [2024-11-18 13:10:25,348 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-18 13:10:25,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:25,500 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_679 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_681 (Array Int Int)) (v_ArrVal_680 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse1 (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|)) (.cse2 (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| |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 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_682) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_680) (select (select (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 .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_681) .cse1) .cse2)) (+ 4 (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 .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_679) .cse1) .cse2))))))) is different from false [2024-11-18 13:10:26,255 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse4))) (or (forall ((v_ArrVal_679 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_681 (Array Int Int)) (v_ArrVal_680 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |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|)) (.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |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 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_682) .cse0 v_ArrVal_680) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse0 v_ArrVal_681) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse0 v_ArrVal_679) .cse2) .cse3) 4))))) (and (= .cse1 .cse0) (= .cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse4))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19| Int)) (not (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19|)))))))) is different from false [2024-11-18 13:10:26,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:10:26,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 146 [2024-11-18 13:10:26,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442150939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:26,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:10:26,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 50 [2024-11-18 13:10:26,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289026001] [2024-11-18 13:10:26,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:26,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-18 13:10:26,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:26,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-18 13:10:26,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3220, Unknown=19, NotChecked=230, Total=3660 [2024-11-18 13:10:26,915 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 50 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 41 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:10:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:29,148 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2024-11-18 13:10:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-18 13:10:29,149 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 41 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2024-11-18 13:10:29,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:29,150 INFO L225 Difference]: With dead ends: 78 [2024-11-18 13:10:29,151 INFO L226 Difference]: Without dead ends: 76 [2024-11-18 13:10:29,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=362, Invalid=5479, Unknown=19, NotChecked=302, Total=6162 [2024-11-18 13:10:29,153 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 56 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:29,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 407 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 13:10:29,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-18 13:10:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2024-11-18 13:10:29,163 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-18 13:10:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2024-11-18 13:10:29,164 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 38 [2024-11-18 13:10:29,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:29,164 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2024-11-18 13:10:29,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 41 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:10:29,165 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2024-11-18 13:10:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 13:10:29,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:29,166 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-18 13:10:29,181 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-18 13:10:29,366 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-18 13:10:29,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:29,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2080860260, now seen corresponding path program 2 times [2024-11-18 13:10:29,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:29,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375593528] [2024-11-18 13:10:29,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:10:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:29,399 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:10:29,400 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:10:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:10:30,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375593528] [2024-11-18 13:10:30,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375593528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:30,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647852847] [2024-11-18 13:10:30,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:10:30,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:30,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:30,802 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-18 13:10:30,803 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-18 13:10:30,973 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:10:30,974 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:10:30,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 141 conjuncts are in the unsatisfiable core [2024-11-18 13:10:30,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:30,987 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-18 13:10:31,079 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-18 13:10:31,081 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-18 13:10:31,092 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-18 13:10:31,108 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-18 13:10:31,114 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-18 13:10:31,116 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-18 13:10:31,149 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-18 13:10:31,149 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 45 treesize of output 31 [2024-11-18 13:10:31,166 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-18 13:10:31,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-18 13:10:31,178 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)) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (= (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 |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1))) is different from false [2024-11-18 13:10:31,180 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)) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (= (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 |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1))) is different from true [2024-11-18 13:10:31,208 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (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 |c_#memory_$Pointer$#2.base| .cse2) 0))) (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (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 |v_#valid_BEFORE_CALL_12| .cse2) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse0)) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-18 13:10:31,210 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (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 |c_#memory_$Pointer$#2.base| .cse2) 0))) (and (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (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 |v_#valid_BEFORE_CALL_12| .cse2) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse0)) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-18 13:10:31,223 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-18 13:10:31,223 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 60 treesize of output 35 [2024-11-18 13:10:31,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-18 13:10:31,246 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_#valid_BEFORE_CALL_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) (v_arrayElimIndex_8 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_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-18 13:10:31,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_#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) (v_arrayElimIndex_8 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_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-18 13:10:31,271 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#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_#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) (v_arrayElimIndex_8 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_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-18 13:10:31,273 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#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_#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) (v_arrayElimIndex_8 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_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-18 13:10:31,317 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-18 13:10:31,327 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|)) is different from false [2024-11-18 13:10:31,329 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|)) is different from true [2024-11-18 13:10:31,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:31,398 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-18 13:10:31,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 57 [2024-11-18 13:10:31,418 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:10:31,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2024-11-18 13:10:31,478 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4)) (= |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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (or (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse2)) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-18 13:10:31,482 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4)) (= |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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (or (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse2)) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-18 13:10:31,588 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-18 13:10:31,592 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-18 13:10:31,688 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= (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|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (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|)) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-18 13:10:31,692 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= (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|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (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|)) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-18 13:10:31,842 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:10:31,843 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:10:31,844 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-18 13:10:31,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= (select (select |c_#memory_$Pointer$#2.base| (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|)) (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|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse1 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-18 13:10:31,872 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= (select (select |c_#memory_$Pointer$#2.base| (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|)) (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|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse1 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-18 13:10:31,986 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:10:31,986 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:10:31,994 INFO L349 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2024-11-18 13:10:31,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 43 [2024-11-18 13:10:32,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (exists ((|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) (v_arrayElimIndex_8 Int)) (let ((.cse3 (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 ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2024-11-18 13:10:32,028 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (exists ((|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) (v_arrayElimIndex_8 Int)) (let ((.cse3 (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 ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from true [2024-11-18 13:10:32,139 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-18 13:10:32,148 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 67 treesize of output 26 [2024-11-18 13:10:32,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-11-18 13:10:32,212 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-18 13:10:32,212 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 64 treesize of output 56 [2024-11-18 13:10:32,232 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-18 13:10:32,232 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-18 13:10:35,509 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse2 (exists ((v_arrayElimIndex_10 Int) (v_arrayElimCell_85 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse11 (select |v_#valid_BEFORE_CALL_14| .cse11)))) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimCell_85) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_10) 1) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_85)) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0))))) (or (and (exists ((|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) (v_arrayElimIndex_8 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) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (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_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) .cse2) (and .cse2 (exists ((|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) (v_arrayElimIndex_8 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) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|)) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1))))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (exists ((v_arrayElimCell_86 Int)) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_86) 1) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse6 (select |v_#valid_BEFORE_CALL_14| .cse6)))) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_86) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimCell_86) 0))) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_86) 0))))) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((v_arrayElimIndex_10 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse9 (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 (= |v_#valid_BEFORE_CALL_14| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse8 (select |v_#valid_BEFORE_CALL_14| .cse8)))) (= (select |v_#valid_BEFORE_CALL_15| .cse9) 0) (= (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) (= (select |v_#valid_BEFORE_CALL_12| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse10 (select |v_#valid_BEFORE_CALL_13| .cse10))) |v_#valid_BEFORE_CALL_13|))) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse7) 4)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2024-11-18 13:10:35,514 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse2 (exists ((v_arrayElimIndex_10 Int) (v_arrayElimCell_85 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse11 (select |v_#valid_BEFORE_CALL_14| .cse11)))) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimCell_85) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_10) 1) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_85)) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0))))) (or (and (exists ((|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) (v_arrayElimIndex_8 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) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (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_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) .cse2) (and .cse2 (exists ((|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) (v_arrayElimIndex_8 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) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|)) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1))))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (exists ((v_arrayElimCell_86 Int)) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_86) 1) (exists ((v_arrayElimIndex_10 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse6 (select |v_#valid_BEFORE_CALL_14| .cse6)))) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_86) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimCell_86) 0))) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_86) 0))))) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((v_arrayElimIndex_10 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse9 (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 (= |v_#valid_BEFORE_CALL_14| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse8 (select |v_#valid_BEFORE_CALL_14| .cse8)))) (= (select |v_#valid_BEFORE_CALL_15| .cse9) 0) (= (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) (= (select |v_#valid_BEFORE_CALL_12| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimIndex_10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse10 (select |v_#valid_BEFORE_CALL_13| .cse10))) |v_#valid_BEFORE_CALL_13|))) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse7) 4)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from true [2024-11-18 13:10:35,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:10:35,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 341 treesize of output 357 [2024-11-18 13:10:35,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:10:35,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 278 treesize of output 334 [2024-11-18 13:10:35,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-18 13:10:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-11-18 13:10:35,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:35,890 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int))) (or (not (= v_ArrVal_845 (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_845 |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_845) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_846) (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))))) is different from false [2024-11-18 13:10:35,919 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int))) (or (not (= v_ArrVal_845 (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_845 |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_845) (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|) v_ArrVal_846) (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))))) is different from false [2024-11-18 13:10:35,941 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_845) (select (select |c_#memory_$Pointer$#2.base| (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$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) v_ArrVal_846) (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)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_845 (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_845 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2024-11-18 13:10:35,965 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int))) (or (not (= v_ArrVal_845 (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_845 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_845) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1))) v_ArrVal_846) (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|))) (+ (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_~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-18 13:10:35,978 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int))) (or (not (= v_ArrVal_845 (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_845 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_845) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1))) v_ArrVal_846) (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_#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|))))))) is different from false [2024-11-18 13:10:36,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:10:36,051 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 354 treesize of output 358 [2024-11-18 13:10:36,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 326 treesize of output 294 [2024-11-18 13:10:36,099 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 413 treesize of output 381 [2024-11-18 13:10:36,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647852847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:36,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:10:36,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 35 [2024-11-18 13:10:36,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108596298] [2024-11-18 13:10:36,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:36,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-18 13:10:36,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:36,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-18 13:10:36,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=506, Unknown=31, NotChecked=1098, Total=1722 [2024-11-18 13:10:36,278 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 35 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 28 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-18 13:10:36,431 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) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= (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_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |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-18 13:10:36,432 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) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= (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_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |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-18 13:10:36,435 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (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.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select .cse1 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |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 .cse2 0) 0) (= (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from false [2024-11-18 13:10:36,437 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (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.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select .cse1 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |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 .cse2 0) 0) (= (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from true [2024-11-18 13:10:36,441 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (.cse0 (select .cse4 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (select .cse4 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse0) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= |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) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse1) (= (select .cse2 0) 0)) (= (select |c_#valid| .cse0) 1) (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| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |c_#valid| .cse3)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1)))) is different from false [2024-11-18 13:10:36,443 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (.cse0 (select .cse4 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (select .cse4 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse0) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= |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) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse1) (= (select .cse2 0) 0)) (= (select |c_#valid| .cse0) 1) (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| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |c_#valid| .cse3)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1)))) is different from true [2024-11-18 13:10:36,447 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (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|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse1)) (.cse6 (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|))) (and (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) .cse2) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (= (select |c_#valid| .cse5) 1) (= .cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse1)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse3)) (= (select |c_#valid| .cse2) 1) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) .cse6)))) is different from false [2024-11-18 13:10:36,449 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (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|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse1)) (.cse6 (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|))) (and (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) .cse2) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (= (select |c_#valid| .cse5) 1) (= .cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse1)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse3)) (= (select |c_#valid| .cse2) 1) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) .cse6)))) is different from true [2024-11-18 13:10:36,453 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_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) (v_arrayElimIndex_8 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_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-18 13:10:36,455 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_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) (v_arrayElimIndex_8 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_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-18 13:10:36,459 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@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) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (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|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse1) 0)) (exists ((|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) (v_arrayElimIndex_8 Int)) (let ((.cse3 (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 ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|))) is different from false [2024-11-18 13:10:36,462 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@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) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (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|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse1) 0)) (exists ((|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) (v_arrayElimIndex_8 Int)) (let ((.cse3 (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 ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|))) is different from true [2024-11-18 13:10:36,473 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (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|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse1)) (.cse5 (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|))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) .cse2) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_#valid_BEFORE_CALL_14| .cse3)))) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4)) (= |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|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (or (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse4)) (= .cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse1)) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) .cse5)))) is different from false [2024-11-18 13:10:36,476 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (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|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse1)) (.cse5 (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|))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) .cse2) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_#valid_BEFORE_CALL_14| .cse3)))) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4)) (= |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|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (or (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse4)) (= .cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse1)) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) .cse5)))) is different from true [2024-11-18 13:10:36,487 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (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|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse1)) (.cse5 (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|))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) .cse2) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_#valid_BEFORE_CALL_14| .cse3)))) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (= .cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse1)) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse4) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse2)) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) .cse5)))) is different from false [2024-11-18 13:10:36,490 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (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|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse1)) (.cse5 (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|))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) .cse2) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_#valid_BEFORE_CALL_14| .cse3)))) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (= .cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse1)) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse4) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse2)) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) .cse5)))) is different from true [2024-11-18 13:10:36,502 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (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 (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|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse7 (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.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_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= .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|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse3) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse7)) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse7) .cse1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= .cse7 0)))) is different from false [2024-11-18 13:10:36,505 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (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 (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|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse7 (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.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_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= .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|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse3) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse7)) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse7) .cse1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= .cse7 0)))) is different from true [2024-11-18 13:10:36,519 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|))) (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|)) (.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|)) (.cse2 (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|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) .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|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_#valid_BEFORE_CALL_14| .cse3)))) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2) .cse4) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0) 0) (= .cse4 .cse5) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-18 13:10:36,523 WARN L873 $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|))) (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|)) (.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|)) (.cse2 (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|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) .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|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_#valid_BEFORE_CALL_14| .cse3)))) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2) .cse4) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0) 0) (= .cse4 .cse5) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-18 13:10:36,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (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| .cse0) 0))) (and (= (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) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1)))) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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.base| .cse2) 0)) (= .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|)) (= (select (select |c_#memory_$Pointer$#2.base| (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|)) .cse3) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse0 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-18 13:10:36,544 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (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| .cse0) 0))) (and (= (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) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1)))) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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.base| .cse2) 0)) (= .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|)) (= (select (select |c_#memory_$Pointer$#2.base| (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|)) .cse3) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse0 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-18 13:10:36,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= (select (select |c_#memory_$Pointer$#2.base| (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|)) (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|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse1 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-18 13:10:36,564 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_#valid_BEFORE_CALL_14|))) (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= (select (select |c_#memory_$Pointer$#2.base| (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|)) (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|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|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) (v_arrayElimIndex_8 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_13| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_8) 1)))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse1 .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~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|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-18 13:10:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:36,690 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2024-11-18 13:10:36,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 13:10:36,691 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 28 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2024-11-18 13:10:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:36,692 INFO L225 Difference]: With dead ends: 76 [2024-11-18 13:10:36,692 INFO L226 Difference]: Without dead ends: 64 [2024-11-18 13:10:36,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=122, Invalid=593, Unknown=55, NotChecked=2310, Total=3080 [2024-11-18 13:10:36,693 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1037 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:36,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 266 Invalid, 0 Unknown, 1037 Unchecked, 0.2s Time] [2024-11-18 13:10:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-18 13:10:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-18 13:10:36,708 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-18 13:10:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-11-18 13:10:36,709 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 38 [2024-11-18 13:10:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:36,710 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-11-18 13:10:36,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 28 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-18 13:10:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-11-18 13:10:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-18 13:10:36,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:36,711 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-18 13:10:36,731 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-18 13:10:36,911 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-18 13:10:36,912 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:36,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1392203254, now seen corresponding path program 1 times [2024-11-18 13:10:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:36,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208893529] [2024-11-18 13:10:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:36,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:38,793 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-18 13:10:38,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:38,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208893529] [2024-11-18 13:10:38,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208893529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:38,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538999137] [2024-11-18 13:10:38,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:38,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:38,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:38,795 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-18 13:10:38,796 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-18 13:10:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:38,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 160 conjuncts are in the unsatisfiable core [2024-11-18 13:10:38,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:39,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:10:39,223 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:10:39,224 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-18 13:10:39,275 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-18 13:10:39,346 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-18 13:10:39,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2024-11-18 13:10:39,545 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-18 13:10:39,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-18 13:10:39,862 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:10:39,863 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-18 13:10:39,896 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-18 13:10:39,897 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 20 treesize of output 22 [2024-11-18 13:10:40,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:40,860 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 86 treesize of output 44 [2024-11-18 13:10:40,890 INFO L349 Elim1Store]: treesize reduction 88, result has 23.5 percent of original size [2024-11-18 13:10:40,891 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 5 case distinctions, treesize of input 133 treesize of output 66 [2024-11-18 13:10:40,918 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-18 13:10:40,918 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 120 treesize of output 96 [2024-11-18 13:10:40,936 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-18 13:10:40,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-18 13:10:41,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:41,252 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-18 13:10:41,368 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-18 13:10:41,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 55 [2024-11-18 13:10:41,372 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 [2024-11-18 13:10:41,422 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-18 13:10:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:10:41,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:41,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:10:41,733 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 51 treesize of output 50 [2024-11-18 13:10:50,016 WARN L286 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 685 DAG size of output: 291 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-18 13:10:50,016 INFO L349 Elim1Store]: treesize reduction 11756, result has 18.1 percent of original size [2024-11-18 13:10:50,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 1 disjoint index pairs (out of 120 index pairs), introduced 20 new quantified variables, introduced 138 case distinctions, treesize of input 1445000 treesize of output 1155157 [2024-11-18 13:10:55,656 INFO L224 Elim1Store]: Index analysis took 145 ms [2024-11-18 13:10:58,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:10:58,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 56612 treesize of output 56182