./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB --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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:07:50,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:07:50,896 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 20:07:50,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:07:50,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:07:50,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:07:50,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:07:50,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:07:50,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:07:50,955 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:07:50,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:07:50,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:07:50,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:07:50,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:07:50,957 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:07:50,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:07:50,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:07:50,958 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:07:50,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:07:50,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:07:50,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:07:50,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:07:50,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:07:50,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:07:50,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:07:50,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:07:50,960 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:07:50,960 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:07:50,960 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:07:50,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:07:50,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:07:50,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:07:50,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:07:50,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:07:50,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:07:50,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:07:50,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:07:50,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:07:50,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:07:50,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:07:50,961 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:07:50,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:07:50,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:07:50,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:07:50,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:07:50,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:07:50,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:07:50,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:07:50,962 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2024-11-27 20:07:51,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:07:51,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:07:51,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:07:51,336 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:07:51,336 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:07:51,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-11-27 20:07:54,493 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/data/4aed29857/7895934205bc468c93d33f853b26caf7/FLAG1dd750f42 [2024-11-27 20:07:54,879 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:07:54,880 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-11-27 20:07:54,895 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/data/4aed29857/7895934205bc468c93d33f853b26caf7/FLAG1dd750f42 [2024-11-27 20:07:54,911 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/data/4aed29857/7895934205bc468c93d33f853b26caf7 [2024-11-27 20:07:54,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:07:54,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:07:54,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:07:54,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:07:54,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:07:54,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:07:54" (1/1) ... [2024-11-27 20:07:54,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@393824f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:54, skipping insertion in model container [2024-11-27 20:07:54,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:07:54" (1/1) ... [2024-11-27 20:07:54,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:07:55,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2024-11-27 20:07:55,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:07:55,388 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:07:55,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2024-11-27 20:07:55,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:07:55,472 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:07:55,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55 WrapperNode [2024-11-27 20:07:55,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:07:55,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:07:55,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:07:55,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:07:55,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (1/1) ... [2024-11-27 20:07:55,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (1/1) ... [2024-11-27 20:07:55,540 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 156 [2024-11-27 20:07:55,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:07:55,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:07:55,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:07:55,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:07:55,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (1/1) ... [2024-11-27 20:07:55,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (1/1) ... [2024-11-27 20:07:55,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (1/1) ... [2024-11-27 20:07:55,603 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 16, 10]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2024-11-27 20:07:55,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (1/1) ... [2024-11-27 20:07:55,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (1/1) ... [2024-11-27 20:07:55,617 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (1/1) ... [2024-11-27 20:07:55,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (1/1) ... [2024-11-27 20:07:55,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (1/1) ... [2024-11-27 20:07:55,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (1/1) ... [2024-11-27 20:07:55,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (1/1) ... [2024-11-27 20:07:55,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:07:55,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:07:55,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:07:55,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:07:55,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (1/1) ... [2024-11-27 20:07:55,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:07:55,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:07:55,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:07:55,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:07:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 20:07:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 20:07:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 20:07:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 20:07:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 20:07:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 20:07:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-27 20:07:55,710 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-27 20:07:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:07:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:07:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:07:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 20:07:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 20:07:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 20:07:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 20:07:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 20:07:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 20:07:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:07:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 20:07:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 20:07:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 20:07:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:07:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 20:07:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 20:07:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:07:55,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:07:55,898 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:07:55,901 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:07:56,318 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-27 20:07:56,319 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:07:56,334 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:07:56,334 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-27 20:07:56,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:07:56 BoogieIcfgContainer [2024-11-27 20:07:56,336 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:07:56,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:07:56,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:07:56,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:07:56,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:07:54" (1/3) ... [2024-11-27 20:07:56,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33abf3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:07:56, skipping insertion in model container [2024-11-27 20:07:56,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:55" (2/3) ... [2024-11-27 20:07:56,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33abf3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:07:56, skipping insertion in model container [2024-11-27 20:07:56,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:07:56" (3/3) ... [2024-11-27 20:07:56,351 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2024-11-27 20:07:56,372 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:07:56,373 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_append_unequal.i that has 2 procedures, 42 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-27 20:07:56,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:07:56,472 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;@6c33db14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:07:56,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:07:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 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-27 20:07:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-27 20:07:56,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:07:56,487 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:56,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:07:56,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:56,493 INFO L85 PathProgramCache]: Analyzing trace with hash -103165547, now seen corresponding path program 1 times [2024-11-27 20:07:56,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:56,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629631449] [2024-11-27 20:07:56,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:56,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:56,798 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-27 20:07:56,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:56,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629631449] [2024-11-27 20:07:56,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629631449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:56,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:56,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:56,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039440734] [2024-11-27 20:07:56,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:56,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:07:56,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:56,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:07:56,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:07:56,846 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-27 20:07:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:07:56,876 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2024-11-27 20:07:56,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:07:56,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 25 [2024-11-27 20:07:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:07:56,886 INFO L225 Difference]: With dead ends: 77 [2024-11-27 20:07:56,886 INFO L226 Difference]: Without dead ends: 33 [2024-11-27 20:07:56,891 INFO L434 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-27 20:07:56,897 INFO L435 NwaCegarLoop]: 53 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, 53 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-27 20:07:56,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:07:56,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-27 20:07:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-27 20:07:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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-27 20:07:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-27 20:07:56,948 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 25 [2024-11-27 20:07:56,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:07:56,950 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-27 20:07:56,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-27 20:07:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-11-27 20:07:56,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-27 20:07:56,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:07:56,952 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:56,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:07:56,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:07:56,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1383300035, now seen corresponding path program 1 times [2024-11-27 20:07:56,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:56,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337561419] [2024-11-27 20:07:56,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:56,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:57,319 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-27 20:07:57,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:57,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337561419] [2024-11-27 20:07:57,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337561419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:57,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:57,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:07:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396435304] [2024-11-27 20:07:57,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:57,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:57,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:57,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:57,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:57,326 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-27 20:07:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:07:57,365 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2024-11-27 20:07:57,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:57,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 26 [2024-11-27 20:07:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:07:57,366 INFO L225 Difference]: With dead ends: 62 [2024-11-27 20:07:57,366 INFO L226 Difference]: Without dead ends: 36 [2024-11-27 20:07:57,367 INFO L434 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-27 20:07:57,368 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 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-27 20:07:57,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:07:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-27 20:07:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-27 20:07:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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-27 20:07:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-27 20:07:57,378 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 26 [2024-11-27 20:07:57,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:07:57,378 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-27 20:07:57,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-27 20:07:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-27 20:07:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:07:57,379 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:07:57,379 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:57,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:07:57,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:07:57,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:57,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1324341454, now seen corresponding path program 1 times [2024-11-27 20:07:57,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:57,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7336900] [2024-11-27 20:07:57,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:57,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:58,212 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-27 20:07:58,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:58,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7336900] [2024-11-27 20:07:58,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7336900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:07:58,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284227087] [2024-11-27 20:07:58,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:58,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:07:58,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:07:58,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:07:58,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:07:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:58,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-27 20:07:58,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:07:58,618 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-27 20:07:59,055 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:07:59,055 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-27 20:07:59,145 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-27 20:07:59,296 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:07:59,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-27 20:07:59,485 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 38 treesize of output 14 [2024-11-27 20:07:59,497 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-27 20:07:59,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:07:59,839 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 46 treesize of output 35 [2024-11-27 20:07:59,875 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-27 20:07:59,875 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 32 treesize of output 34 [2024-11-27 20:08:00,250 INFO L349 Elim1Store]: treesize reduction 67, result has 29.5 percent of original size [2024-11-27 20:08:00,251 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 67 [2024-11-27 20:08:00,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-11-27 20:08:00,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-27 20:08:00,408 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 28 treesize of output 20 [2024-11-27 20:08:00,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:08:00,493 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 39 [2024-11-27 20:08:00,506 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 16 treesize of output 8 [2024-11-27 20:08:00,558 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-27 20:08:00,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:01,064 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (v_ArrVal_222 Int) (v_ArrVal_221 Int) (v_ArrVal_219 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_10| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_10|) 0)) (not (= (select .cse0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (not (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse0 |ULTIMATE.start_sll_circular_append_~head#1.offset| v_ArrVal_222)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_10| v_ArrVal_219) .cse1) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset| v_ArrVal_221)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2024-11-27 20:08:01,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284227087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:01,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:08:01,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21] total 28 [2024-11-27 20:08:01,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546777059] [2024-11-27 20:08:01,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:01,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-27 20:08:01,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:01,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-27 20:08:01,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=973, Unknown=1, NotChecked=62, Total=1122 [2024-11-27 20:08:01,074 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 22 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:08:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:02,023 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2024-11-27 20:08:02,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-27 20:08:02,025 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 22 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2024-11-27 20:08:02,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:02,027 INFO L225 Difference]: With dead ends: 64 [2024-11-27 20:08:02,028 INFO L226 Difference]: Without dead ends: 52 [2024-11-27 20:08:02,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=133, Invalid=1430, Unknown=1, NotChecked=76, Total=1640 [2024-11-27 20:08:02,032 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:02,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 499 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:08:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-27 20:08:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2024-11-27 20:08:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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-27 20:08:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-11-27 20:08:02,048 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 34 [2024-11-27 20:08:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:02,048 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-27 20:08:02,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 22 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:08:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-11-27 20:08:02,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 20:08:02,050 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:02,050 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:02,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:08:02,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:02,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:08:02,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:02,252 INFO L85 PathProgramCache]: Analyzing trace with hash 627797540, now seen corresponding path program 1 times [2024-11-27 20:08:02,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773729466] [2024-11-27 20:08:02,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:02,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:03,704 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-27 20:08:03,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:03,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773729466] [2024-11-27 20:08:03,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773729466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:03,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193610463] [2024-11-27 20:08:03,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:03,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:03,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:03,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:03,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:08:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:03,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-27 20:08:03,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:03,948 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-27 20:08:04,194 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:08:04,195 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-27 20:08:04,267 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-27 20:08:04,363 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:08:04,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-27 20:08:04,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-11-27 20:08:04,498 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-27 20:08:04,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:08:04,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-11-27 20:08:04,696 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-27 20:08:04,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-27 20:08:04,911 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-11-27 20:08:04,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2024-11-27 20:08:04,950 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2024-11-27 20:08:04,950 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 3 case distinctions, treesize of input 68 treesize of output 74 [2024-11-27 20:08:05,002 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 28 treesize of output 20 [2024-11-27 20:08:05,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-27 20:08:05,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-27 20:08:05,079 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-27 20:08:05,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:05,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193610463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:05,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:08:05,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 31 [2024-11-27 20:08:05,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621813959] [2024-11-27 20:08:05,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:05,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-27 20:08:05,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:05,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-27 20:08:05,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1014, Unknown=22, NotChecked=0, Total=1122 [2024-11-27 20:08:05,493 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 24 states have internal predecessors, (52), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:08:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:06,550 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2024-11-27 20:08:06,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-27 20:08:06,551 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 24 states have internal predecessors, (52), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2024-11-27 20:08:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:06,552 INFO L225 Difference]: With dead ends: 84 [2024-11-27 20:08:06,552 INFO L226 Difference]: Without dead ends: 76 [2024-11-27 20:08:06,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=177, Invalid=1962, Unknown=23, NotChecked=0, Total=2162 [2024-11-27 20:08:06,554 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 71 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:06,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 388 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:08:06,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-27 20:08:06,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2024-11-27 20:08:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 20:08:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2024-11-27 20:08:06,578 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 37 [2024-11-27 20:08:06,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:06,578 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2024-11-27 20:08:06,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 24 states have internal predecessors, (52), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:08:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2024-11-27 20:08:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 20:08:06,582 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:06,582 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:06,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 20:08:06,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:06,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:08:06,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:06,784 INFO L85 PathProgramCache]: Analyzing trace with hash 465742163, now seen corresponding path program 1 times [2024-11-27 20:08:06,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:06,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123740580] [2024-11-27 20:08:06,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:06,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:08:08,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:08,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123740580] [2024-11-27 20:08:08,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123740580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:08,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665788784] [2024-11-27 20:08:08,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:08,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:08,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:08,159 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:08,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:08:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:08,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-27 20:08:08,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:08,884 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-27 20:08:09,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:08:09,192 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:08:09,192 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-27 20:08:09,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-27 20:08:09,422 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 18 treesize of output 13 [2024-11-27 20:08:09,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-27 20:08:09,681 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-27 20:08:09,887 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-27 20:08:09,887 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 26 treesize of output 29 [2024-11-27 20:08:09,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-27 20:08:09,937 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-27 20:08:09,938 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 20 treesize of output 22 [2024-11-27 20:08:10,318 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 65 treesize of output 32 [2024-11-27 20:08:10,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:08:10,325 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 32 treesize of output 21 [2024-11-27 20:08:10,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-27 20:08:10,400 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 21 treesize of output 13 [2024-11-27 20:08:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:08:10,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:10,706 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_497) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_495) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_497 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_497 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2024-11-27 20:08:10,751 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_15| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_15|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_497) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_495) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_497 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_15| (select v_ArrVal_497 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_15|))))))) is different from false [2024-11-27 20:08:10,771 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_15| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_15|) (not (= v_ArrVal_497 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_15| (select v_ArrVal_497 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_15|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_497) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_495) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2024-11-27 20:08:10,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665788784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:10,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:08:10,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 37 [2024-11-27 20:08:10,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610847547] [2024-11-27 20:08:10,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:10,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-27 20:08:10,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:10,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-27 20:08:10,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1538, Unknown=3, NotChecked=240, Total=1892 [2024-11-27 20:08:10,968 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 37 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 29 states have internal predecessors, (60), 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-27 20:08:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:12,422 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2024-11-27 20:08:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 20:08:12,423 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 29 states have internal predecessors, (60), 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 40 [2024-11-27 20:08:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:12,425 INFO L225 Difference]: With dead ends: 75 [2024-11-27 20:08:12,428 INFO L226 Difference]: Without dead ends: 60 [2024-11-27 20:08:12,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=221, Invalid=2650, Unknown=3, NotChecked=318, Total=3192 [2024-11-27 20:08:12,431 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:12,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 552 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 20:08:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-27 20:08:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-27 20:08:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 20:08:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2024-11-27 20:08:12,451 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 40 [2024-11-27 20:08:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:12,451 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2024-11-27 20:08:12,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 29 states have internal predecessors, (60), 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-27 20:08:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2024-11-27 20:08:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-27 20:08:12,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:12,453 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:12,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 20:08:12,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:12,654 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:08:12,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash 988264577, now seen corresponding path program 1 times [2024-11-27 20:08:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:12,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054653354] [2024-11-27 20:08:12,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 20:08:16,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054653354] [2024-11-27 20:08:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054653354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661685042] [2024-11-27 20:08:16,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:16,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:16,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:16,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:16,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:08:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:16,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-27 20:08:16,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:16,447 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-27 20:08:16,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:08:16,772 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:08:16,772 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-27 20:08:16,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-27 20:08:16,875 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-27 20:08:16,992 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:08:16,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 20:08:17,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2024-11-27 20:08:17,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-11-27 20:08:17,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-27 20:08:17,227 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-27 20:08:17,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:08:17,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-11-27 20:08:17,488 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-27 20:08:17,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-27 20:08:17,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-27 20:08:18,066 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:08:18,067 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:08:18,068 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 16 [2024-11-27 20:08:18,270 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 31 treesize of output 21 [2024-11-27 20:08:18,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-27 20:08:18,377 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 21 treesize of output 13 [2024-11-27 20:08:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:08:18,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661685042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:19,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:08:19,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2024-11-27 20:08:19,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002242604] [2024-11-27 20:08:19,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:19,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-27 20:08:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:19,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-27 20:08:19,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2435, Unknown=83, NotChecked=0, Total=2652 [2024-11-27 20:08:19,561 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 44 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 37 states have internal predecessors, (71), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-27 20:08:23,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:23,231 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2024-11-27 20:08:23,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-27 20:08:23,231 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 37 states have internal predecessors, (71), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2024-11-27 20:08:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:23,233 INFO L225 Difference]: With dead ends: 121 [2024-11-27 20:08:23,233 INFO L226 Difference]: Without dead ends: 113 [2024-11-27 20:08:23,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=403, Invalid=6649, Unknown=88, NotChecked=0, Total=7140 [2024-11-27 20:08:23,236 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 149 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:23,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1052 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-27 20:08:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-27 20:08:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2024-11-27 20:08:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 73 states have internal predecessors, (85), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 20:08:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2024-11-27 20:08:23,258 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 43 [2024-11-27 20:08:23,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:23,259 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2024-11-27 20:08:23,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 37 states have internal predecessors, (71), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-27 20:08:23,259 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2024-11-27 20:08:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-27 20:08:23,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:23,260 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:23,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 20:08:23,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:23,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:08:23,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:23,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1802947949, now seen corresponding path program 2 times [2024-11-27 20:08:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:23,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939173621] [2024-11-27 20:08:23,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:08:23,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:23,528 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:08:23,529 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:08:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:08:28,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:28,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939173621] [2024-11-27 20:08:28,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939173621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:28,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713473806] [2024-11-27 20:08:28,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:08:28,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:28,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:28,598 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:28,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:08:28,805 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:08:28,805 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:08:28,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-27 20:08:28,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:28,852 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-27 20:08:29,076 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#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|) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0)))) is different from false [2024-11-27 20:08:29,078 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#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|) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0)))) is different from true [2024-11-27 20:08:29,091 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-27 20:08:29,113 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-27 20:08:29,121 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 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)) is different from false [2024-11-27 20:08:29,124 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 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)) is different from true [2024-11-27 20:08:29,189 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-27 20:08:29,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 34 [2024-11-27 20:08:29,204 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-27 20:08:29,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2024-11-27 20:08:29,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.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_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)))) is different from false [2024-11-27 20:08:29,229 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.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_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)))) is different from true [2024-11-27 20:08:29,276 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1))) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) is different from false [2024-11-27 20:08:29,279 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1))) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) is different from true [2024-11-27 20:08:29,303 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-27 20:08:29,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2024-11-27 20:08:29,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:08:29,313 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-27 20:08:29,334 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-27 20:08:29,337 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-27 20:08:29,366 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-27 20:08:29,369 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-27 20:08:29,432 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2024-11-27 20:08:29,435 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2024-11-27 20:08:29,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:08:29,529 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-27 20:08:29,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2024-11-27 20:08:29,592 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-27 20:08:29,592 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 3 case distinctions, treesize of input 35 treesize of output 73 [2024-11-27 20:08:29,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 0)))) (or (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-11-27 20:08:29,637 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 0)))) (or (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-11-27 20:08:29,762 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |v_#valid_BEFORE_CALL_19| .cse2)))) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse3) 0)))) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) is different from false [2024-11-27 20:08:29,767 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |v_#valid_BEFORE_CALL_19| .cse2)))) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse3) 0)))) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) is different from true [2024-11-27 20:08:29,874 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |v_#valid_BEFORE_CALL_19| .cse2)))) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse3) 0)))) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) is different from false [2024-11-27 20:08:29,878 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |v_#valid_BEFORE_CALL_19| .cse2)))) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse3) 0)))) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) is different from true [2024-11-27 20:08:30,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0)))) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_old(#valid)_AFTER_CALL_15| .cse6)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3))))) is different from false [2024-11-27 20:08:30,163 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0)))) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_old(#valid)_AFTER_CALL_15| .cse6)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3))))) is different from true [2024-11-27 20:08:30,474 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse7) .cse8)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse7) .cse8)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0)))) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_old(#valid)_AFTER_CALL_15| .cse6)))) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0)))) is different from false [2024-11-27 20:08:30,479 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse7) .cse8)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse7) .cse8)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0)))) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_old(#valid)_AFTER_CALL_15| .cse6)))) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0)))) is different from true [2024-11-27 20:08:30,534 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-11-27 20:08:30,534 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 86 treesize of output 39 [2024-11-27 20:08:30,545 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-27 20:08:30,545 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 19 treesize of output 7 [2024-11-27 20:08:30,583 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-27 20:08:30,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-27 20:08:30,628 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |v_#valid_BEFORE_CALL_19| .cse2)))) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse3) 0)))))) is different from false [2024-11-27 20:08:30,633 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |v_#valid_BEFORE_CALL_19| .cse2)))) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse3) 0)))))) is different from true [2024-11-27 20:08:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 17 not checked. [2024-11-27 20:08:30,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:31,033 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| v_ArrVal_787)) (.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| v_ArrVal_788)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse6 (select (select .cse0 .cse3) .cse5)) (.cse7 (select (select .cse4 .cse3) .cse5))) (let ((.cse1 (select (select .cse0 .cse6) .cse7)) (.cse2 (select (select .cse4 .cse6) .cse7))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse3)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26|) 0)) (not (= (select (select .cse4 .cse1) .cse2) .cse5))))))) is different from false [2024-11-27 20:08:31,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713473806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:31,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:08:31,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 43 [2024-11-27 20:08:31,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553518359] [2024-11-27 20:08:31,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:31,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-27 20:08:31,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:31,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-27 20:08:31,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1108, Unknown=27, NotChecked=1106, Total=2352 [2024-11-27 20:08:31,038 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 43 states, 40 states have (on average 1.675) internal successors, (67), 34 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 20:08:31,364 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#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) (= (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) (= |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_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0)))) is different from false [2024-11-27 20:08:31,366 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#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) (= (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) (= |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_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0)))) is different from true [2024-11-27 20:08:31,373 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (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_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) is different from false [2024-11-27 20:08:31,375 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (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_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) is different from true [2024-11-27 20:08:31,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)))) is different from false [2024-11-27 20:08:31,385 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)))) is different from true [2024-11-27 20:08:31,390 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse5 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1))) (= (select |c_#valid| .cse3) 1) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 0) .cse3)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0))))) is different from false [2024-11-27 20:08:31,392 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse5 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1))) (= (select |c_#valid| .cse3) 1) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 0) .cse3)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0))))) is different from true [2024-11-27 20:08:31,413 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-27 20:08:31,416 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-27 20:08:31,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse1)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |v_#valid_BEFORE_CALL_19| .cse2)))) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse3) 0)))) (= (select .cse4 0) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| .cse4)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse1 (select |c_#memory_$Pointer$#1.offset| .cse1))))) is different from false [2024-11-27 20:08:31,427 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse1)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |v_#valid_BEFORE_CALL_19| .cse2)))) (= (select |v_#valid_BEFORE_CALL_19| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse3) 0)))) (= (select .cse4 0) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| .cse4)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse1 (select |c_#memory_$Pointer$#1.offset| .cse1))))) is different from true [2024-11-27 20:08:31,445 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse7 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0)) 0) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 0) .cse3)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0)))) (or (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse6) 0) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse6)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0))))) is different from false [2024-11-27 20:08:31,451 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse7 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0)) 0) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 0) .cse3)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0)))) (or (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse6) 0) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse6)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0))))) is different from true [2024-11-27 20:08:31,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse1 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= 0 |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.offset|) (not (= (select (select |c_#memory_$Pointer$#1.base| (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse3) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) .cse3)) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse2)) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse7) 0)))) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse5) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse8 (select |v_old(#valid)_AFTER_CALL_15| .cse8)))) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.base| .cse3) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3)))))) is different from false [2024-11-27 20:08:31,473 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse1 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= 0 |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.offset|) (not (= (select (select |c_#memory_$Pointer$#1.base| (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse3) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) .cse3)) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse2)) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse7) 0)))) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse5) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse8 (select |v_old(#valid)_AFTER_CALL_15| .cse8)))) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.base| .cse3) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3)))))) is different from true [2024-11-27 20:08:31,494 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select .cse1 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0)))) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_old(#valid)_AFTER_CALL_15| .cse6)))) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0))) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse7)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (not (= .cse7 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0)))) is different from false [2024-11-27 20:08:31,499 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select .cse1 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0)))) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_old(#valid)_AFTER_CALL_15| .cse6)))) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0))) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse7)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (not (= .cse7 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0)))) is different from true [2024-11-27 20:08:31,520 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse10 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse1)) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse1 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse7) 0)))) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse8) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse9 (select |v_old(#valid)_AFTER_CALL_15| .cse9)))) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)))))) is different from false [2024-11-27 20:08:31,526 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse10 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse1)) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse1 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse7) 0)))) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse8) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse9 (select |v_old(#valid)_AFTER_CALL_15| .cse9)))) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 0))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)))))) is different from true [2024-11-27 20:08:31,551 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse3 (select .cse11 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse6 (select .cse1 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse2 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse7 (select |v_#valid_BEFORE_CALL_19| .cse7)))) (= (select |v_#valid_BEFORE_CALL_19| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse8) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse9) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse10 (select |v_old(#valid)_AFTER_CALL_15| .cse10)))) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse9)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6)))))) is different from false [2024-11-27 20:08:31,556 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse3 (select .cse11 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse6 (select .cse1 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse2 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse7 (select |v_#valid_BEFORE_CALL_19| .cse7)))) (= (select |v_#valid_BEFORE_CALL_19| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse8) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse9) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 1) (= |v_old(#valid)_AFTER_CALL_15| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_21| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_21| .cse10 (select |v_old(#valid)_AFTER_CALL_15| .cse10)))) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse9)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6)))))) is different from true [2024-11-27 20:08:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:31,818 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2024-11-27 20:08:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-27 20:08:31,818 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 1.675) internal successors, (67), 34 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2024-11-27 20:08:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:31,819 INFO L225 Difference]: With dead ends: 99 [2024-11-27 20:08:31,820 INFO L226 Difference]: Without dead ends: 81 [2024-11-27 20:08:31,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=143, Invalid=1240, Unknown=49, NotChecked=2350, Total=3782 [2024-11-27 20:08:31,822 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1318 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:31,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 525 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 340 Invalid, 0 Unknown, 1318 Unchecked, 0.4s Time] [2024-11-27 20:08:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-27 20:08:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-27 20:08:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 72 states have internal predecessors, (82), 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-27 20:08:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2024-11-27 20:08:31,842 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 46 [2024-11-27 20:08:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:31,843 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2024-11-27 20:08:31,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 1.675) internal successors, (67), 34 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 20:08:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2024-11-27 20:08:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-27 20:08:31,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:31,845 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:31,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 20:08:32,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:32,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:08:32,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash -966053909, now seen corresponding path program 1 times [2024-11-27 20:08:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:32,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891352892] [2024-11-27 20:08:32,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-27 20:08:32,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:32,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891352892] [2024-11-27 20:08:32,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891352892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:32,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272801154] [2024-11-27 20:08:32,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:32,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:32,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:32,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:32,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:08:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:32,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:08:32,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-27 20:08:32,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:08:32,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272801154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:32,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:08:32,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-27 20:08:32,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391657972] [2024-11-27 20:08:32,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:32,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:08:32,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:32,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:08:32,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:08:32,469 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 20:08:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:32,503 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2024-11-27 20:08:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:08:32,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2024-11-27 20:08:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:32,505 INFO L225 Difference]: With dead ends: 94 [2024-11-27 20:08:32,505 INFO L226 Difference]: Without dead ends: 48 [2024-11-27 20:08:32,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:08:32,507 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:32,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:08:32,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-27 20:08:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-27 20:08:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 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-27 20:08:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2024-11-27 20:08:32,523 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 48 [2024-11-27 20:08:32,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:32,523 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2024-11-27 20:08:32,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 20:08:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2024-11-27 20:08:32,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-27 20:08:32,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:32,528 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:32,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-27 20:08:32,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:32,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:08:32,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:32,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1329705887, now seen corresponding path program 1 times [2024-11-27 20:08:32,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:32,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122991768] [2024-11-27 20:08:32,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:32,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:08:38,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:38,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122991768] [2024-11-27 20:08:38,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122991768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:38,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064673493] [2024-11-27 20:08:38,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:38,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:38,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:38,087 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:38,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:08:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:38,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 188 conjuncts are in the unsatisfiable core [2024-11-27 20:08:38,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:38,602 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-27 20:08:38,618 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-27 20:08:38,914 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 18 treesize of output 7 [2024-11-27 20:08:39,059 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:08:39,060 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-27 20:08:39,083 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-27 20:08:39,209 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-27 20:08:39,228 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 19 treesize of output 11 [2024-11-27 20:08:39,246 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-27 20:08:39,455 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:08:39,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 75 [2024-11-27 20:08:39,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-27 20:08:39,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 20:08:39,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-11-27 20:08:39,799 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-27 20:08:39,805 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-27 20:08:39,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 20:08:40,263 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-27 20:08:40,263 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-27 20:08:40,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:08:40,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2024-11-27 20:08:40,346 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-27 20:08:40,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-27 20:08:40,363 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 24 treesize of output 19 [2024-11-27 20:08:42,363 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-11-27 20:08:42,364 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 2 case distinctions, treesize of input 152 treesize of output 89 [2024-11-27 20:08:42,374 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2024-11-27 20:08:42,384 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2024-11-27 20:08:42,392 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 35 treesize of output 33 [2024-11-27 20:08:42,405 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 24 treesize of output 19 [2024-11-27 20:08:42,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:08:42,587 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 88 treesize of output 60 [2024-11-27 20:08:43,452 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 38 treesize of output 22 [2024-11-27 20:08:43,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-27 20:08:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:08:43,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:43,901 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1097 Int) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1097)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1100) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1101) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1098) .cse0) .cse1)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1102) .cse0) .cse1) 4))))) is different from false [2024-11-27 20:08:45,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064673493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:45,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:08:45,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 57 [2024-11-27 20:08:45,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706473129] [2024-11-27 20:08:45,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:45,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-27 20:08:45,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:45,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-27 20:08:45,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4304, Unknown=2, NotChecked=132, Total=4692 [2024-11-27 20:08:45,921 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 57 states, 53 states have (on average 1.509433962264151) internal successors, (80), 48 states have internal predecessors, (80), 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-27 20:08:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:49,938 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2024-11-27 20:08:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-27 20:08:49,939 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 1.509433962264151) internal successors, (80), 48 states have internal predecessors, (80), 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 49 [2024-11-27 20:08:49,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:49,940 INFO L225 Difference]: With dead ends: 57 [2024-11-27 20:08:49,940 INFO L226 Difference]: Without dead ends: 55 [2024-11-27 20:08:49,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=481, Invalid=7353, Unknown=2, NotChecked=174, Total=8010 [2024-11-27 20:08:49,943 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 78 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:49,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 400 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-27 20:08:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-27 20:08:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-11-27 20:08:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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-27 20:08:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-27 20:08:49,959 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 49 [2024-11-27 20:08:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:49,960 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-27 20:08:49,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 1.509433962264151) internal successors, (80), 48 states have internal predecessors, (80), 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-27 20:08:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-27 20:08:49,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-27 20:08:49,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:49,961 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:49,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-27 20:08:50,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:50,163 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:08:50,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:50,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1329780349, now seen corresponding path program 1 times [2024-11-27 20:08:50,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:50,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794025701] [2024-11-27 20:08:50,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:50,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-27 20:08:50,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:50,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794025701] [2024-11-27 20:08:50,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794025701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:50,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128066661] [2024-11-27 20:08:50,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:50,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:50,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:50,691 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:50,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:08:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:50,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-11-27 20:08:50,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:50,998 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-27 20:08:51,220 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:08:51,220 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-27 20:08:51,275 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-27 20:08:51,288 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 15 treesize of output 1 [2024-11-27 20:08:51,370 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:08:51,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 20:08:51,378 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 16 treesize of output 1 [2024-11-27 20:08:51,482 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-27 20:08:51,489 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-27 20:08:51,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:08:51,742 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-27 20:08:51,766 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-27 20:08:51,766 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-27 20:08:51,782 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 8 treesize of output 1 [2024-11-27 20:08:52,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2024-11-27 20:08:52,274 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 8 treesize of output 1 [2024-11-27 20:08:52,350 INFO L349 Elim1Store]: treesize reduction 52, result has 43.5 percent of original size [2024-11-27 20:08:52,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 78 [2024-11-27 20:08:52,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2024-11-27 20:08:52,386 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-27 20:08:52,386 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 1 case distinctions, treesize of input 49 treesize of output 42 [2024-11-27 20:08:52,411 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-27 20:09:19,058 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-27 20:09:19,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-27 20:09:21,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:21,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 299 treesize of output 307 [2024-11-27 20:09:30,101 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2024-11-27 20:09:30,101 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 60 [2024-11-27 20:09:30,107 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2024-11-27 20:09:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 20:09:30,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:42,577 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1248 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1248)) (.cse5 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse8 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse5 .cse3) .cse7)) (.cse0 (select (select .cse6 .cse3) .cse7))) (let ((.cse1 (select (select .cse6 .cse4) .cse0)) (.cse2 (select .cse5 .cse4))) (or (not (= .cse0 .cse1)) (not (= (select .cse2 .cse1) .cse3)) (not (= .cse4 (select .cse2 .cse0)))))))) is different from false [2024-11-27 20:09:43,799 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34| v_ArrVal_1256))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse0 (select .cse11 |ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (let ((.cse8 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34| v_ArrVal_1257) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34| v_ArrVal_1248)) (.cse7 (let ((.cse10 (store .cse0 |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34|))) (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse10) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34| (store (select (store .cse11 |ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse10) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| .cse1)))) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse7 .cse4) .cse9)) (.cse5 (select (select .cse8 .cse4) .cse9))) (let ((.cse3 (select (select .cse8 .cse6) .cse5)) (.cse2 (select .cse7 .cse6))) (or (not (= (select .cse0 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse1)) (not (= (select .cse2 .cse3) .cse4)) (not (= .cse5 .cse3)) (not (= .cse6 (select .cse2 .cse5))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34|) 0))))))))) is different from false [2024-11-27 20:09:43,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128066661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:09:43,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:09:43,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 28] total 35 [2024-11-27 20:09:43,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404313868] [2024-11-27 20:09:43,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:43,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-27 20:09:43,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:43,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-27 20:09:43,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1648, Unknown=22, NotChecked=166, Total=1980 [2024-11-27 20:09:43,806 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 30 states have internal predecessors, (71), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 20:09:52,458 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-27 20:10:00,544 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-27 20:10:04,576 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-27 20:10:12,670 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-27 20:10:16,699 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-27 20:10:20,732 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-27 20:10:30,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:30,703 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2024-11-27 20:10:30,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-27 20:10:30,704 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 30 states have internal predecessors, (71), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2024-11-27 20:10:30,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:30,704 INFO L225 Difference]: With dead ends: 77 [2024-11-27 20:10:30,704 INFO L226 Difference]: Without dead ends: 69 [2024-11-27 20:10:30,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 72.1s TimeCoverageRelationStatistics Valid=302, Invalid=3219, Unknown=27, NotChecked=234, Total=3782 [2024-11-27 20:10:30,707 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 58 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 9 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:30,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 316 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 820 Invalid, 6 Unknown, 0 Unchecked, 25.1s Time] [2024-11-27 20:10:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-27 20:10:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2024-11-27 20:10:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 60 states have internal predecessors, (67), 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-27 20:10:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-11-27 20:10:30,728 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 49 [2024-11-27 20:10:30,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:30,729 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-11-27 20:10:30,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 30 states have internal predecessors, (71), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 20:10:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-11-27 20:10:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-27 20:10:30,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:30,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:10:30,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 20:10:30,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-27 20:10:30,930 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:10:30,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:30,931 INFO L85 PathProgramCache]: Analyzing trace with hash 785500180, now seen corresponding path program 1 times [2024-11-27 20:10:30,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:10:30,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612313095] [2024-11-27 20:10:30,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:30,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:10:34,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:10:34,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612313095] [2024-11-27 20:10:34,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612313095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:10:34,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697671328] [2024-11-27 20:10:34,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:34,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:10:34,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:10:34,502 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:10:34,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 20:10:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:34,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 145 conjuncts are in the unsatisfiable core [2024-11-27 20:10:34,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:10:34,810 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-27 20:10:35,102 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:10:35,102 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-27 20:10:35,194 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-27 20:10:35,203 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-27 20:10:35,323 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-27 20:10:35,323 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 56 treesize of output 38 [2024-11-27 20:10:35,336 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 27 treesize of output 22 [2024-11-27 20:10:35,553 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-27 20:10:35,553 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 64 treesize of output 31 [2024-11-27 20:10:35,559 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-27 20:10:35,564 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-27 20:10:35,759 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-27 20:10:35,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:10:35,922 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-27 20:10:35,922 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 72 treesize of output 55 [2024-11-27 20:10:35,951 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-27 20:10:35,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2024-11-27 20:10:35,996 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-27 20:10:35,996 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-27 20:10:36,657 INFO L349 Elim1Store]: treesize reduction 52, result has 42.9 percent of original size [2024-11-27 20:10:36,658 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 3 case distinctions, treesize of input 79 treesize of output 83 [2024-11-27 20:10:36,702 INFO L349 Elim1Store]: treesize reduction 82, result has 22.6 percent of original size [2024-11-27 20:10:36,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 147 treesize of output 144 [2024-11-27 20:10:36,737 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-27 20:10:36,737 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2024-11-27 20:10:36,765 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2024-11-27 20:10:36,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 41 [2024-11-27 20:10:36,813 INFO L349 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2024-11-27 20:10:36,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 97 [2024-11-27 20:10:36,827 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 22 treesize of output 28 [2024-11-27 20:10:36,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-27 20:10:36,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:10:36,869 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 16 treesize of output 1 [2024-11-27 20:10:36,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 17 [2024-11-27 20:10:36,965 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 17 treesize of output 13 [2024-11-27 20:10:37,020 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 22 treesize of output 16 [2024-11-27 20:10:38,045 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-27 20:10:38,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-27 20:10:39,062 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 406 treesize of output 278 [2024-11-27 20:10:45,446 INFO L349 Elim1Store]: treesize reduction 112, result has 91.5 percent of original size [2024-11-27 20:10:45,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 23 new quantified variables, introduced 136 case distinctions, treesize of input 729 treesize of output 1583 [2024-11-27 20:10:45,854 INFO L224 Elim1Store]: Index analysis took 215 ms [2024-11-27 20:10:49,942 INFO L349 Elim1Store]: treesize reduction 112, result has 91.5 percent of original size [2024-11-27 20:10:49,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 361 treesize of output 1497 [2024-11-27 20:14:11,379 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-27 20:14:11,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-27 20:14:11,380 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-27 20:14:11,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-27 20:14:11,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:11,582 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:584) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 60 more [2024-11-27 20:14:11,588 INFO L158 Benchmark]: Toolchain (without parser) took 376672.90ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 93.4MB in the beginning and 663.5MB in the end (delta: -570.1MB). Peak memory consumption was 806.5MB. Max. memory is 16.1GB. [2024-11-27 20:14:11,590 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:14:11,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.31ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 74.8MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:14:11,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.38ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 72.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:14:11,591 INFO L158 Benchmark]: Boogie Preprocessor took 95.39ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 69.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:14:11,591 INFO L158 Benchmark]: RCFGBuilder took 699.07ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 52.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:14:11,592 INFO L158 Benchmark]: TraceAbstraction took 375248.79ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 51.4MB in the beginning and 663.5MB in the end (delta: -612.0MB). Peak memory consumption was 764.5MB. Max. memory is 16.1GB. [2024-11-27 20:14:11,594 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.31ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 74.8MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.38ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 72.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 95.39ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 69.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 699.07ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 52.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 375248.79ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 51.4MB in the beginning and 663.5MB in the end (delta: -612.0MB). Peak memory consumption was 764.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB --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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:14:14,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:14:14,517 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-27 20:14:14,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:14:14,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:14:14,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:14:14,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:14:14,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:14:14,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:14:14,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:14:14,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:14:14,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:14:14,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:14:14,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:14:14,571 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:14:14,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:14:14,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:14:14,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:14:14,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:14:14,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:14:14,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:14:14,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:14:14,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:14:14,575 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:14:14,575 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:14:14,575 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:14:14,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:14:14,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:14:14,576 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:14:14,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:14:14,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:14:14,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:14:14,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:14:14,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:14:14,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:14,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:14:14,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:14:14,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:14:14,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:14:14,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:14,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:14:14,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:14:14,577 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:14:14,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:14:14,577 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:14:14,577 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:14:14,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:14:14,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:14:14,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:14:14,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:14:14,579 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2024-11-27 20:14:14,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:14:14,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:14:14,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:14:14,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:14:14,988 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:14:14,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-11-27 20:14:18,199 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/data/8448dbb9b/04b050c2fe1044438952209f6ccdb6af/FLAGc8f85a897 [2024-11-27 20:14:18,573 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:14:18,577 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-11-27 20:14:18,598 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/data/8448dbb9b/04b050c2fe1044438952209f6ccdb6af/FLAGc8f85a897 [2024-11-27 20:14:18,624 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/data/8448dbb9b/04b050c2fe1044438952209f6ccdb6af [2024-11-27 20:14:18,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:14:18,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:14:18,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:14:18,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:14:18,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:14:18,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:14:18" (1/1) ... [2024-11-27 20:14:18,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cfea223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:18, skipping insertion in model container [2024-11-27 20:14:18,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:14:18" (1/1) ... [2024-11-27 20:14:18,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:14:19,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2024-11-27 20:14:19,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:14:19,176 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:14:19,261 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2024-11-27 20:14:19,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:14:19,309 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:14:19,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19 WrapperNode [2024-11-27 20:14:19,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:14:19,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:14:19,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:14:19,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:14:19,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (1/1) ... [2024-11-27 20:14:19,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (1/1) ... [2024-11-27 20:14:19,392 INFO L138 Inliner]: procedures = 130, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 157 [2024-11-27 20:14:19,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:14:19,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:14:19,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:14:19,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:14:19,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (1/1) ... [2024-11-27 20:14:19,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (1/1) ... [2024-11-27 20:14:19,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (1/1) ... [2024-11-27 20:14:19,465 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 16, 10]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2024-11-27 20:14:19,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (1/1) ... [2024-11-27 20:14:19,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (1/1) ... [2024-11-27 20:14:19,481 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (1/1) ... [2024-11-27 20:14:19,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (1/1) ... [2024-11-27 20:14:19,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (1/1) ... [2024-11-27 20:14:19,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (1/1) ... [2024-11-27 20:14:19,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (1/1) ... [2024-11-27 20:14:19,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:14:19,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:14:19,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:14:19,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:14:19,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (1/1) ... [2024-11-27 20:14:19,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:19,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:19,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:14:19,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:14:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-27 20:14:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-27 20:14:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-27 20:14:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-27 20:14:19,590 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-27 20:14:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:14:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:14:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:14:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 20:14:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 20:14:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 20:14:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 20:14:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 20:14:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 20:14:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:14:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-27 20:14:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-27 20:14:19,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-27 20:14:19,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 20:14:19,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 20:14:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 20:14:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:14:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 20:14:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-27 20:14:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:14:19,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:14:19,802 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:14:19,804 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:14:20,383 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-27 20:14:20,383 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:14:20,396 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:14:20,397 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-27 20:14:20,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:14:20 BoogieIcfgContainer [2024-11-27 20:14:20,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:14:20,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:14:20,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:14:20,406 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:14:20,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:14:18" (1/3) ... [2024-11-27 20:14:20,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6e5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:14:20, skipping insertion in model container [2024-11-27 20:14:20,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:19" (2/3) ... [2024-11-27 20:14:20,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6e5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:14:20, skipping insertion in model container [2024-11-27 20:14:20,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:14:20" (3/3) ... [2024-11-27 20:14:20,412 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2024-11-27 20:14:20,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:14:20,437 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_append_unequal.i that has 2 procedures, 42 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-27 20:14:20,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:14:20,548 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;@77c00e3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:14:20,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:14:20,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 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-27 20:14:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-27 20:14:20,566 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:20,567 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:20,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:20,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash -103165547, now seen corresponding path program 1 times [2024-11-27 20:14:20,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:20,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463147631] [2024-11-27 20:14:20,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:20,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:20,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:20,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:20,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:14:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:20,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 20:14:20,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:20,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:20,969 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:20,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463147631] [2024-11-27 20:14:20,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463147631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:20,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:20,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:14:20,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225859217] [2024-11-27 20:14:20,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:20,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:14:20,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:21,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:14:21,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:14:21,012 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:14:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:21,042 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2024-11-27 20:14:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:14:21,044 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-27 20:14:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:21,051 INFO L225 Difference]: With dead ends: 77 [2024-11-27 20:14:21,051 INFO L226 Difference]: Without dead ends: 33 [2024-11-27 20:14:21,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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-27 20:14:21,059 INFO L435 NwaCegarLoop]: 53 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, 53 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-27 20:14:21,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:21,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-27 20:14:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-27 20:14:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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-27 20:14:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-27 20:14:21,110 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 25 [2024-11-27 20:14:21,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:21,112 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-27 20:14:21,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:14:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-11-27 20:14:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-27 20:14:21,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:21,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:21,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 20:14:21,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:21,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:21,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:21,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1383300035, now seen corresponding path program 1 times [2024-11-27 20:14:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:21,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44386668] [2024-11-27 20:14:21,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:21,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:21,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:21,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:21,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:14:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:21,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-27 20:14:21,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:22,025 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-27 20:14:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:22,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:14:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 20:14:22,210 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:22,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44386668] [2024-11-27 20:14:22,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44386668] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:14:22,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:14:22,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2024-11-27 20:14:22,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053864599] [2024-11-27 20:14:22,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:14:22,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:14:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:22,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:14:22,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:14:22,215 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 20:14:26,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:14:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:27,236 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2024-11-27 20:14:27,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:14:27,239 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-11-27 20:14:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:27,241 INFO L225 Difference]: With dead ends: 74 [2024-11-27 20:14:27,241 INFO L226 Difference]: Without dead ends: 62 [2024-11-27 20:14:27,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-27 20:14:27,245 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 29 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:27,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 244 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2024-11-27 20:14:27,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-27 20:14:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2024-11-27 20:14:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-27 20:14:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-27 20:14:27,265 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2024-11-27 20:14:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:27,265 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-27 20:14:27,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 20:14:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-27 20:14:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-27 20:14:27,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:27,267 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:27,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:14:27,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:27,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:27,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash 834335033, now seen corresponding path program 1 times [2024-11-27 20:14:27,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:27,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033067208] [2024-11-27 20:14:27,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:27,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:27,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:27,472 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:27,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:14:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:27,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:14:27,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:27,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:27,690 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:27,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033067208] [2024-11-27 20:14:27,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033067208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:27,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:27,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:14:27,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682284082] [2024-11-27 20:14:27,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:27,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:14:27,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:27,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:14:27,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:27,693 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:14:27,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:27,738 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2024-11-27 20:14:27,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:14:27,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-27 20:14:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:27,740 INFO L225 Difference]: With dead ends: 62 [2024-11-27 20:14:27,740 INFO L226 Difference]: Without dead ends: 36 [2024-11-27 20:14:27,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-27 20:14:27,741 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 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-27 20:14:27,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-27 20:14:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-27 20:14:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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-27 20:14:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-27 20:14:27,749 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 29 [2024-11-27 20:14:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:27,749 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-27 20:14:27,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:14:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-27 20:14:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:14:27,751 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:27,751 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:27,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:14:27,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:27,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:27,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1324341454, now seen corresponding path program 1 times [2024-11-27 20:14:27,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:27,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1595575102] [2024-11-27 20:14:27,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:27,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:27,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:27,959 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:27,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:14:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:28,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-27 20:14:28,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:28,452 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-27 20:14:28,481 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-27 20:14:28,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:14:28,624 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-27 20:14:28,626 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:28,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595575102] [2024-11-27 20:14:28,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595575102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:14:28,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:14:28,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2024-11-27 20:14:28,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966312769] [2024-11-27 20:14:28,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:14:28,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:14:28,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:28,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:14:28,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:14:28,630 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 20:14:32,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:14:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:33,464 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2024-11-27 20:14:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 20:14:33,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-27 20:14:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:33,466 INFO L225 Difference]: With dead ends: 53 [2024-11-27 20:14:33,466 INFO L226 Difference]: Without dead ends: 41 [2024-11-27 20:14:33,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-27 20:14:33,467 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 23 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:33,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 261 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-11-27 20:14:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-27 20:14:33,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-11-27 20:14:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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-27 20:14:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-11-27 20:14:33,477 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 34 [2024-11-27 20:14:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:33,477 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-27 20:14:33,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 20:14:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-11-27 20:14:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 20:14:33,478 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:33,479 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:33,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 20:14:33,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:33,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:33,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:33,684 INFO L85 PathProgramCache]: Analyzing trace with hash 627797540, now seen corresponding path program 1 times [2024-11-27 20:14:33,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:33,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531058245] [2024-11-27 20:14:33,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:33,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:33,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:33,689 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:33,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:14:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:33,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-27 20:14:33,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:33,933 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 7 [2024-11-27 20:14:34,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-27 20:14:34,317 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-27 20:14:34,317 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 17 treesize of output 17 [2024-11-27 20:14:34,678 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-27 20:14:34,711 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-11-27 20:14:34,712 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 53 treesize of output 46 [2024-11-27 20:14:34,818 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 28 treesize of output 20 [2024-11-27 20:14:34,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-27 20:14:34,953 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-27 20:14:35,024 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-27 20:14:35,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:14:35,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:14:35,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:14:35,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:14:35,188 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 61 treesize of output 64 [2024-11-27 20:14:35,201 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 40 treesize of output 34 [2024-11-27 20:14:35,375 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-27 20:14:35,375 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 11 treesize of output 11 [2024-11-27 20:14:35,694 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:35,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531058245] [2024-11-27 20:14:35,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531058245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:14:35,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1485045819] [2024-11-27 20:14:35,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:35,695 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:14:35,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:14:35,698 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:14:35,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-27 20:14:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:36,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-27 20:14:36,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:36,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:14:36,875 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-27 20:14:37,097 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:14:37,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-27 20:14:37,336 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-27 20:14:37,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-27 20:14:38,176 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 19 treesize of output 11 [2024-11-27 20:14:38,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-27 20:14:38,763 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-27 20:14:38,764 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-27 20:14:38,846 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-27 20:14:38,847 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 24 treesize of output 26 [2024-11-27 20:14:39,754 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-27 20:14:39,762 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-27 20:14:39,982 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-27 20:14:40,284 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-27 20:14:40,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:14:40,745 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_331) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_330) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_331 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_331 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2024-11-27 20:14:41,054 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= v_ArrVal_331 (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_331 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_331) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_330) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2024-11-27 20:14:41,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_335) .cse0) .cse1 (select v_ArrVal_331 .cse1))) v_ArrVal_331)) (= (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_331) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_330) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22|)))))) is different from false [2024-11-27 20:14:41,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1485045819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:14:41,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:14:41,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 35 [2024-11-27 20:14:41,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372677773] [2024-11-27 20:14:41,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:14:41,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-27 20:14:41,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:41,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-27 20:14:41,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1521, Unknown=14, NotChecked=240, Total=1892 [2024-11-27 20:14:41,174 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 35 states, 32 states have (on average 1.75) internal successors, (56), 28 states have internal predecessors, (56), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-27 20:14:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:46,619 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2024-11-27 20:14:46,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-27 20:14:46,621 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 1.75) internal successors, (56), 28 states have internal predecessors, (56), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2024-11-27 20:14:46,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:46,624 INFO L225 Difference]: With dead ends: 71 [2024-11-27 20:14:46,624 INFO L226 Difference]: Without dead ends: 63 [2024-11-27 20:14:46,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=234, Invalid=2734, Unknown=14, NotChecked=324, Total=3306 [2024-11-27 20:14:46,628 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 73 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:46,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 709 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-27 20:14:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-27 20:14:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2024-11-27 20:14:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 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-27 20:14:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-27 20:14:46,646 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 37 [2024-11-27 20:14:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:46,647 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-27 20:14:46,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 1.75) internal successors, (56), 28 states have internal predecessors, (56), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-27 20:14:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2024-11-27 20:14:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 20:14:46,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:46,649 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:46,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-27 20:14:46,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-27 20:14:47,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:14:47,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:47,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:47,052 INFO L85 PathProgramCache]: Analyzing trace with hash -873570890, now seen corresponding path program 1 times [2024-11-27 20:14:47,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:47,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [850755556] [2024-11-27 20:14:47,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:47,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:47,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:47,055 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:47,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:14:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:47,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-27 20:14:47,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:47,333 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 7 [2024-11-27 20:14:47,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-27 20:14:47,771 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-27 20:14:47,771 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 17 treesize of output 17 [2024-11-27 20:14:48,921 INFO L349 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2024-11-27 20:14:48,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 112 [2024-11-27 20:14:48,983 INFO L349 Elim1Store]: treesize reduction 61, result has 19.7 percent of original size [2024-11-27 20:14:48,983 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 63 [2024-11-27 20:14:49,001 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 44 treesize of output 39 [2024-11-27 20:14:49,044 INFO L349 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2024-11-27 20:14:49,044 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 85 treesize of output 1 [2024-11-27 20:14:49,344 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 79 treesize of output 55 [2024-11-27 20:14:49,353 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 59 treesize of output 35 [2024-11-27 20:14:49,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-27 20:14:49,371 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 21 treesize of output 13 [2024-11-27 20:14:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 20:14:49,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:14:49,727 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_402) .cse1) .cse0)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_399) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_401) .cse1) .cse0)))))) is different from false [2024-11-27 20:14:49,831 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_399) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_401) .cse0) .cse2)))) (forall ((|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse2 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_402) .cse0) .cse2)))))) is different from false [2024-11-27 20:14:50,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:14:50,188 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 191 treesize of output 178 [2024-11-27 20:14:50,339 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-27 20:14:50,340 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 69 [2024-11-27 20:14:50,361 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 104 treesize of output 98 [2024-11-27 20:14:50,382 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 98 treesize of output 86 [2024-11-27 20:14:50,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:14:50,463 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 71 treesize of output 74 [2024-11-27 20:14:50,489 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 40 treesize of output 34 [2024-11-27 20:14:51,172 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-27 20:14:51,173 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 11 treesize of output 11 [2024-11-27 20:14:51,480 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:51,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850755556] [2024-11-27 20:14:51,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850755556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:14:51,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1015262978] [2024-11-27 20:14:51,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:51,481 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:14:51,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:14:51,483 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:14:51,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-27 20:14:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:52,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-27 20:14:52,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:52,161 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 7 [2024-11-27 20:14:53,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-27 20:14:53,599 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-27 20:14:53,599 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 17 treesize of output 17 [2024-11-27 20:14:55,381 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-27 20:14:55,381 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 65 treesize of output 46 [2024-11-27 20:14:55,391 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 24 treesize of output 1 [2024-11-27 20:14:55,463 INFO L349 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2024-11-27 20:14:55,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 70 [2024-11-27 20:14:55,511 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-27 20:14:55,512 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2024-11-27 20:14:55,526 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 16 treesize of output 12 [2024-11-27 20:14:55,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-27 20:14:56,054 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 59 treesize of output 35 [2024-11-27 20:14:56,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-27 20:14:56,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-27 20:14:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 20:14:56,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:14:56,304 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_466) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_467) .cse0) .cse1)))) (forall ((|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_469) .cse0) .cse1) .cse1))))) is different from false [2024-11-27 20:14:56,385 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_469) .cse2) .cse0)))) (forall ((v_ArrVal_466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse2 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_466) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_467) .cse2) .cse0)))))) is different from false [2024-11-27 20:14:56,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:14:56,769 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 349 treesize of output 300 [2024-11-27 20:14:56,900 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-27 20:14:56,900 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 69 [2024-11-27 20:14:56,927 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 104 treesize of output 98 [2024-11-27 20:14:56,941 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 98 treesize of output 86 [2024-11-27 20:14:57,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:14:57,004 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 71 treesize of output 74 [2024-11-27 20:14:57,020 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 40 treesize of output 34 [2024-11-27 20:14:58,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1015262978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:14:58,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:14:58,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2024-11-27 20:14:58,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251157640] [2024-11-27 20:14:58,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:14:58,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-27 20:14:58,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:58,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-27 20:14:58,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2007, Unknown=6, NotChecked=372, Total=2550 [2024-11-27 20:14:58,129 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 39 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 33 states have internal predecessors, (60), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:15:02,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:15:06,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:06,187 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2024-11-27 20:15:06,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-27 20:15:06,188 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 33 states have internal predecessors, (60), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2024-11-27 20:15:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:06,189 INFO L225 Difference]: With dead ends: 68 [2024-11-27 20:15:06,189 INFO L226 Difference]: Without dead ends: 60 [2024-11-27 20:15:06,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=247, Invalid=2843, Unknown=6, NotChecked=444, Total=3540 [2024-11-27 20:15:06,192 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 97 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:06,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 472 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 665 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2024-11-27 20:15:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-27 20:15:06,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2024-11-27 20:15:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 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-27 20:15:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2024-11-27 20:15:06,209 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 40 [2024-11-27 20:15:06,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:06,209 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-27 20:15:06,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 33 states have internal predecessors, (60), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:15:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-11-27 20:15:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-27 20:15:06,211 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:06,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:15:06,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-27 20:15:06,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-27 20:15:06,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:06,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:15:06,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash 988264577, now seen corresponding path program 1 times [2024-11-27 20:15:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:06,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676326664] [2024-11-27 20:15:06,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:06,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:06,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:06,616 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:06,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_868d41ba-3713-413a-9f24-3a0d9b769d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 20:15:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:06,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-27 20:15:06,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:06,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:15:07,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-27 20:15:07,121 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-27 20:15:07,240 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-27 20:15:07,241 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 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-27 20:15:09,098 INFO L349 Elim1Store]: treesize reduction 340, result has 9.8 percent of original size [2024-11-27 20:15:09,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 532 treesize of output 230 [2024-11-27 20:15:09,145 INFO L349 Elim1Store]: treesize reduction 73, result has 17.0 percent of original size [2024-11-27 20:15:09,146 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 189 [2024-11-27 20:15:09,217 INFO L349 Elim1Store]: treesize reduction 132, result has 24.6 percent of original size [2024-11-27 20:15:09,218 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 3 case distinctions, treesize of input 255 treesize of output 243 [2024-11-27 20:15:09,245 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 3 [2024-11-27 20:15:09,443 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 168 treesize of output 124 [2024-11-27 20:15:09,840 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-27 20:15:09,841 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 83 [2024-11-27 20:15:10,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:15:10,193 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 117 treesize of output 85 [2024-11-27 20:15:10,733 INFO L349 Elim1Store]: treesize reduction 56, result has 65.2 percent of original size [2024-11-27 20:15:10,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 139 [2024-11-27 20:15:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 20:15:12,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:15:14,746 INFO L349 Elim1Store]: treesize reduction 19, result has 64.8 percent of original size [2024-11-27 20:15:14,747 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 193 [2024-11-27 20:15:14,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:15:14,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 279 treesize of output 312 [2024-11-27 20:15:14,978 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 232 treesize of output 226 [2024-11-27 20:15:22,976 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (.cse84 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (.cse89 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (let ((.cse90 (select .cse89 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (.cse85 (select .cse84 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse14 (not .cse1)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse35 (or .cse14 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse96 (let ((.cse97 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse97 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse97 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse96 (select (select .cse96 .cse7) .cse6))) v_arrayElimCell_94))))))) (.cse40 (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (= .cse11 v_arrayElimIndex_17) (not (= .cse7 (select (let ((.cse94 (let ((.cse95 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse95 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse95 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse94 (select (select .cse94 .cse7) .cse6))) v_arrayElimCell_94))))) .cse14)) (.cse23 (= .cse8 .cse10)) (.cse17 (forall ((v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (not (= .cse7 (select (let ((.cse93 (store .cse84 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store .cse85 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536)))) (select .cse93 (select (select .cse93 .cse7) .cse6))) v_arrayElimCell_92))))) (.cse32 (= .cse8 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse2 (= .cse7 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse16 (= .cse6 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse75 (or .cse1 (forall ((v_ArrVal_536 (_ BitVec 32))) (not (= .cse7 (select (let ((.cse92 (store .cse89 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store .cse90 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536)))) (select .cse92 (select (select .cse92 .cse7) .cse6))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))) (.cse76 (or (forall ((v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (not (= .cse7 (select (let ((.cse91 (store .cse89 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store .cse90 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536)))) (select .cse91 (select (select .cse91 .cse7) .cse6))) v_arrayElimCell_94)))) .cse14))) (let ((.cse3 (let ((.cse87 (forall ((v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (not (= (select (let ((.cse88 (store .cse89 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store .cse90 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536)))) (select .cse88 (select (select .cse88 .cse7) .cse6))) v_arrayElimCell_92) .cse7))))) (and (or .cse1 .cse87 .cse2) (or .cse16 .cse1 .cse87) .cse75 .cse76))) (.cse20 (= .cse11 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse21 (not (= (select .cse9 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse10))) (.cse22 (not .cse32)) (.cse15 (or .cse1 .cse17)) (.cse18 (or (forall ((v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (not (= .cse7 (select (let ((.cse86 (store .cse84 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store .cse85 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536)))) (select .cse86 (select (select .cse86 .cse7) .cse6))) v_arrayElimCell_94)))) .cse14)) (.cse19 (or .cse1 (forall ((v_ArrVal_536 (_ BitVec 32))) (not (= .cse7 (select (let ((.cse83 (store .cse84 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store .cse85 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536)))) (select .cse83 (select (select .cse83 .cse7) .cse6))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))) (.cse0 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_arrayElimIndex_17) (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse81 (let ((.cse82 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse82 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse82 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse81 (select (select .cse81 .cse7) .cse6))) v_arrayElimCell_92))) (= .cse11 v_arrayElimIndex_17) (= .cse6 v_arrayElimIndex_17)))) (.cse4 (not (= (select .cse9 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse10))) (.cse5 (and (= .cse11 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse23)) (.cse51 (and (or (and (or .cse1 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse77 (let ((.cse78 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse78 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse78 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse77 (select (select .cse77 .cse7) .cse6))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))) .cse35) .cse23) (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse79 (let ((.cse80 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse80 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse80 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse79 (select (select .cse79 .cse7) .cse6))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= .cse11 v_arrayElimIndex_17))) .cse1) .cse40))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 (= .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (or (= .cse7 .cse8) (let ((.cse31 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_arrayElimIndex_17) (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse47 (let ((.cse48 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse48 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse48 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse47 (select (select .cse47 .cse7) .cse6))) v_arrayElimCell_92))) (= .cse11 v_arrayElimIndex_17))))) (and (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_arrayElimIndex_17) (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (= .cse11 v_arrayElimIndex_17) (not (= .cse7 (select (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse13 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse12 (select (select .cse12 .cse7) .cse6))) v_arrayElimCell_94))))) .cse14) (or (and .cse15 (or .cse16 .cse1 .cse17) .cse18 .cse19) .cse20 .cse21 .cse22) (or .cse23 (let ((.cse26 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_arrayElimIndex_17) (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse29 (let ((.cse30 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse30 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse30 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse29 (select (select .cse29 .cse7) .cse6))) v_arrayElimCell_92))))))) (and (or .cse1 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_arrayElimIndex_17) (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse24 (let ((.cse25 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse25 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse25 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse24 (select (select .cse24 .cse7) .cse6))) v_arrayElimIndex_17)))))) (or .cse16 .cse1 .cse26) (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_arrayElimIndex_17) (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse27 (let ((.cse28 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse28 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse28 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse27 (select (select .cse27 .cse7) .cse6))) v_arrayElimCell_94))))) .cse14) (or .cse1 .cse26 .cse2)))) (or .cse16 .cse1 .cse31) (or .cse3 .cse4 .cse5) (or .cse32 (let ((.cse33 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse43 (let ((.cse44 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse44 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse44 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse43 (select (select .cse43 .cse7) .cse6))) v_arrayElimCell_92))) (= .cse11 v_arrayElimIndex_17))))) (and (or .cse33 .cse1 .cse2) (or (let ((.cse34 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse38 (let ((.cse39 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse39 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse39 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse38 (select (select .cse38 .cse7) .cse6))) v_arrayElimCell_92))))))) (and (or .cse16 .cse1 .cse34) (or .cse1 .cse34 .cse2) .cse35 (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse37 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse37 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse36 (select (select .cse36 .cse7) .cse6))) v_arrayElimIndex_17))))) .cse1))) .cse23) (or .cse33 .cse16 .cse1) .cse40 (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse41 (let ((.cse42 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse42 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse42 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse41 (select (select .cse41 .cse7) .cse6))) v_arrayElimIndex_17))) (= .cse11 v_arrayElimIndex_17))) .cse1)))) (or .cse1 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_arrayElimIndex_17) (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse45 (let ((.cse46 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse46 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse46 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse45 (select (select .cse45 .cse7) .cse6))) v_arrayElimIndex_17))) (= .cse11 v_arrayElimIndex_17)))) (or .cse1 .cse31 .cse2)))) (or .cse1 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_arrayElimIndex_17) (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse49 (let ((.cse50 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse50 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse50 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse49 (select (select .cse49 .cse7) .cse6))) v_arrayElimIndex_17))) (= .cse11 v_arrayElimIndex_17) (= .cse6 v_arrayElimIndex_17)))) (or .cse51 .cse2) (or .cse23 (let ((.cse56 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_arrayElimIndex_17) (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse57 (let ((.cse58 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse58 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse58 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse57 (select (select .cse57 .cse7) .cse6))) v_arrayElimCell_92))) (= .cse6 v_arrayElimIndex_17))))) (and (or .cse1 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_arrayElimIndex_17) (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse52 (let ((.cse53 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse53 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse53 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse52 (select (select .cse52 .cse7) .cse6))) v_arrayElimIndex_17))) (= .cse6 v_arrayElimIndex_17)))) (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_arrayElimIndex_17) (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (= .cse6 v_arrayElimIndex_17) (not (= .cse7 (select (let ((.cse54 (let ((.cse55 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse55 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse55 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse54 (select (select .cse54 .cse7) .cse6))) v_arrayElimCell_94))))) .cse14) (or .cse1 .cse56 .cse2) (or .cse16 .cse1 .cse56)))) (or (and .cse18 .cse19) .cse20 .cse21 .cse22) (or .cse14 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_arrayElimIndex_17) (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (= .cse11 v_arrayElimIndex_17) (= .cse6 v_arrayElimIndex_17) (not (= .cse7 (select (let ((.cse59 (let ((.cse60 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse60 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse60 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse59 (select (select .cse59 .cse7) .cse6))) v_arrayElimCell_94)))))) (or .cse32 (let ((.cse70 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse73 (let ((.cse74 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse74 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse74 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse73 (select (select .cse73 .cse7) .cse6))) v_arrayElimCell_92))) (= .cse11 v_arrayElimIndex_17) (= .cse6 v_arrayElimIndex_17))))) (and (or .cse1 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse61 (let ((.cse62 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse62 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse62 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse61 (select (select .cse61 .cse7) .cse6))) v_arrayElimIndex_17))) (= .cse11 v_arrayElimIndex_17) (= .cse6 v_arrayElimIndex_17)))) (or .cse23 (let ((.cse67 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse68 (let ((.cse69 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse69 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse69 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse68 (select (select .cse68 .cse7) .cse6))) v_arrayElimCell_92))) (= .cse6 v_arrayElimIndex_17))))) (and (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (= .cse6 v_arrayElimIndex_17) (not (= .cse7 (select (let ((.cse63 (let ((.cse64 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse64 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse64 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse63 (select (select .cse63 .cse7) .cse6))) v_arrayElimCell_94))))) .cse14) (or .cse1 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (not (= .cse7 (select (let ((.cse65 (let ((.cse66 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse66 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse66 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse65 (select (select .cse65 .cse7) .cse6))) v_arrayElimIndex_17))) (= .cse6 v_arrayElimIndex_17)))) (or .cse16 .cse1 .cse67) (or .cse1 .cse67 .cse2)))) (or .cse1 .cse70 .cse2) (or .cse14 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (or (not (= (select .cse9 v_arrayElimIndex_17) .cse10)) (= .cse11 v_arrayElimIndex_17) (= .cse6 v_arrayElimIndex_17) (not (= .cse7 (select (let ((.cse71 (let ((.cse72 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse9 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse72 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse72 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse71 (select (select .cse71 .cse7) .cse6))) v_arrayElimCell_94)))))) (or .cse16 .cse1 .cse70)))) (or .cse16 .cse20 .cse21 .cse22 (and .cse15 .cse18 (or .cse1 .cse17 .cse2) .cse19)) (or .cse16 .cse0 .cse1) (or .cse4 .cse5 (and .cse75 .cse76)) (or .cse16 .cse51)))))))) is different from true [2024-11-27 20:15:23,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:15:23,449 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 207 treesize of output 170 [2024-11-27 20:15:23,935 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-27 20:15:23,935 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 218 treesize of output 169 [2024-11-27 20:15:24,113 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-27 20:15:24,113 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 200 treesize of output 156 [2024-11-27 20:15:24,226 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-27 20:15:24,226 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 422 treesize of output 338 [2024-11-27 20:15:24,482 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-27 20:15:24,482 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 200 treesize of output 156 [2024-11-27 20:15:25,478 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-27 20:15:25,478 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 850 treesize of output 677 [2024-11-27 20:15:26,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:15:26,154 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 207 treesize of output 170 [2024-11-27 20:15:27,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:15:27,522 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 2496 treesize of output 1983 [2024-11-27 20:15:34,040 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-27 20:15:34,040 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 207 treesize of output 159 [2024-11-27 20:15:34,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:15:34,394 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 872 treesize of output 695 [2024-11-27 20:15:36,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:15:36,531 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 787 treesize of output 630 [2024-11-27 20:15:39,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:15:39,216 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 406 treesize of output 333 [2024-11-27 20:15:44,470 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (= .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse12 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse2 (= .cse6 .cse5)) (.cse21 (not .cse3)) (.cse10 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse30 (and (or .cse3 (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32))) (let ((.cse288 (select .cse10 v_arrayElimCell_116))) (let ((.cse285 (select |c_#memory_$Pointer$#1.base| .cse288))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= (select .cse285 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse286 (let ((.cse287 (store |c_#memory_$Pointer$#1.base| .cse288 (store .cse285 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse287 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse287 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_47))))) (select .cse286 (select (select .cse286 .cse6) v_arrayElimCell_115))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))))) (or .cse3 (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_prenex_49 (_ BitVec 32)) (v_prenex_48 (_ BitVec 32))) (let ((.cse291 (select .cse10 v_arrayElimCell_116))) (let ((.cse292 (select |c_#memory_$Pointer$#1.base| .cse291))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= (select (let ((.cse289 (let ((.cse290 (store |c_#memory_$Pointer$#1.base| .cse291 (store .cse292 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse290 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse290 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_48))))) (select .cse289 (select (select .cse289 .cse6) v_arrayElimCell_115))) v_prenex_49) .cse6)) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= (select .cse292 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (= v_arrayElimCell_115 v_arrayElimCell_116)))))) (or .cse2 (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse296 (select .cse10 v_arrayElimCell_116))) (let ((.cse293 (select |c_#memory_$Pointer$#1.base| .cse296))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= (select .cse293 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse294 (let ((.cse295 (store |c_#memory_$Pointer$#1.base| .cse296 (store .cse293 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse295 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse295 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_46))))) (select .cse294 (select (select .cse294 .cse6) v_arrayElimCell_115))) v_arrayElimCell_92))))))) .cse3) (or .cse21 (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse300 (select .cse10 v_arrayElimCell_116))) (let ((.cse297 (select |c_#memory_$Pointer$#1.base| .cse300))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= (select .cse297 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse298 (let ((.cse299 (store |c_#memory_$Pointer$#1.base| .cse300 (store .cse297 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse299 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse299 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse298 (select (select .cse298 .cse6) v_arrayElimCell_115))) v_arrayElimCell_94)))))))))) (.cse1 (and (or .cse21 (forall ((v_arrayElimCell_117 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse280 (select .cse10 v_arrayElimCell_118))) (let ((.cse277 (select |c_#memory_$Pointer$#1.base| .cse280))) (or (= v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= (select .cse277 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse278 (let ((.cse279 (store |c_#memory_$Pointer$#1.base| .cse280 (store .cse277 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse279 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse279 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse278 (select (select .cse278 .cse6) v_arrayElimCell_117))) v_arrayElimCell_94)))))))) (or .cse3 (forall ((v_arrayElimCell_117 (_ BitVec 32)) (v_prenex_50 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32))) (let ((.cse283 (select .cse10 v_arrayElimCell_118))) (let ((.cse284 (select |c_#memory_$Pointer$#1.base| .cse283))) (or (= v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= .cse6 (select (let ((.cse281 (let ((.cse282 (store |c_#memory_$Pointer$#1.base| .cse283 (store .cse284 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse282 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse282 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_50))))) (select .cse281 (select (select .cse281 .cse6) v_arrayElimCell_117))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (not (= (select .cse284 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5))))))))) (.cse44 (and (or (forall ((v_arrayElimCell_117 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse269 (select .cse10 v_arrayElimCell_118))) (let ((.cse270 (select |c_#memory_$Pointer$#1.base| .cse269))) (or (= .cse269 .cse5) (not (= (select .cse270 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse271 (let ((.cse272 (store |c_#memory_$Pointer$#1.base| .cse269 (store .cse270 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse272 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse272 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse271 (select (select .cse271 .cse6) v_arrayElimCell_117))) v_arrayElimCell_94))))))) .cse21) (or .cse3 (forall ((v_arrayElimCell_117 (_ BitVec 32)) (v_prenex_50 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32))) (let ((.cse275 (select .cse10 v_arrayElimCell_118))) (let ((.cse276 (select |c_#memory_$Pointer$#1.base| .cse275))) (or (not (= .cse6 (select (let ((.cse273 (let ((.cse274 (store |c_#memory_$Pointer$#1.base| .cse275 (store .cse276 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse274 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse274 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_50))))) (select .cse273 (select (select .cse273 .cse6) v_arrayElimCell_117))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= .cse275 .cse5) (not (= (select .cse276 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5))))))))) (.cse128 (and (or .cse3 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse207 (select .cse10 v_arrayElimCell_110))) (let ((.cse208 (select |c_#memory_$Pointer$#1.base| .cse207))) (or (not (= .cse6 (select (let ((.cse205 (let ((.cse206 (store |c_#memory_$Pointer$#1.base| .cse207 (store .cse208 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse206 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse206 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse205 (select (select .cse205 .cse6) v_arrayElimCell_109))) v_arrayElimIndex_17))) (= .cse6 .cse207) (= v_arrayElimCell_110 v_arrayElimIndex_17) (not (= (select .cse208 v_arrayElimIndex_17) .cse5))))))) (or .cse21 (forall ((v_arrayElimCell_94 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse210 (select .cse10 v_arrayElimCell_110))) (let ((.cse209 (select |c_#memory_$Pointer$#1.base| .cse210))) (or (not (= (select .cse209 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (= .cse6 .cse210) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= .cse6 (select (let ((.cse211 (let ((.cse212 (store |c_#memory_$Pointer$#1.base| .cse210 (store .cse209 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse212 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse212 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_25))))) (select .cse211 (select (select .cse211 .cse6) v_arrayElimCell_109))) v_arrayElimCell_94)))))))) (or .cse3 (forall ((v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse215 (select .cse10 v_arrayElimCell_110))) (let ((.cse216 (select |c_#memory_$Pointer$#1.base| .cse215))) (or (not (= .cse6 (select (let ((.cse213 (let ((.cse214 (store |c_#memory_$Pointer$#1.base| .cse215 (store .cse216 v_prenex_35 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse214 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse214 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_36))))) (select .cse213 (select (select .cse213 .cse6) v_arrayElimCell_109))) v_prenex_35))) (= .cse215 .cse5) (= .cse6 .cse215) (not (= (select .cse216 v_prenex_35) .cse5))))))) (or .cse2 .cse3 (forall ((v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse217 (select .cse10 v_arrayElimCell_110))) (let ((.cse220 (select |c_#memory_$Pointer$#1.base| .cse217))) (or (= .cse217 .cse5) (= .cse6 .cse217) (not (= .cse6 (select (let ((.cse218 (let ((.cse219 (store |c_#memory_$Pointer$#1.base| .cse217 (store .cse220 v_prenex_22 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse219 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse219 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_23))))) (select .cse218 (select (select .cse218 .cse6) v_arrayElimCell_109))) v_prenex_24))) (not (= .cse5 (select .cse220 v_prenex_22)))))))) (or .cse3 (forall ((v_prenex_16 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse224 (select .cse10 v_arrayElimCell_110))) (let ((.cse221 (select |c_#memory_$Pointer$#1.base| .cse224))) (or (not (= (select .cse221 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse222 (let ((.cse223 (store |c_#memory_$Pointer$#1.base| .cse224 (store .cse221 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse223 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse223 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_16))))) (select .cse222 (select (select .cse222 .cse6) v_arrayElimCell_109))) v_prenex_17))) (= v_arrayElimCell_110 v_arrayElimCell_109) (= .cse224 .cse5) (= .cse6 .cse224)))))) (or .cse3 (forall ((v_prenex_15 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse226 (select .cse10 v_arrayElimCell_110))) (let ((.cse225 (select |c_#memory_$Pointer$#1.base| .cse226))) (or (not (= (select .cse225 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (= .cse226 .cse5) (not (= .cse6 (select (let ((.cse227 (let ((.cse228 (store |c_#memory_$Pointer$#1.base| .cse226 (store .cse225 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse228 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse228 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_15))))) (select .cse227 (select (select .cse227 .cse6) v_arrayElimCell_109))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= .cse6 .cse226)))))) (or .cse2 .cse3 (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_26 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse231 (select .cse10 v_arrayElimCell_110))) (let ((.cse232 (select |c_#memory_$Pointer$#1.base| .cse231))) (or (not (= (select (let ((.cse229 (let ((.cse230 (store |c_#memory_$Pointer$#1.base| .cse231 (store .cse232 v_prenex_26 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse230 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse230 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_27))))) (select .cse229 (select (select .cse229 .cse6) v_arrayElimCell_109))) v_prenex_28) .cse6)) (= v_arrayElimCell_110 v_prenex_26) (not (= (select .cse232 v_prenex_26) .cse5)) (= .cse6 .cse231)))))) (or .cse2 (forall ((v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse234 (select .cse10 v_arrayElimCell_110))) (let ((.cse233 (select |c_#memory_$Pointer$#1.base| .cse234))) (or (not (= (select .cse233 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (= .cse6 .cse234) (not (= .cse6 (select (let ((.cse235 (let ((.cse236 (store |c_#memory_$Pointer$#1.base| .cse234 (store .cse233 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse236 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse236 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_14))))) (select .cse235 (select (select .cse235 .cse6) v_arrayElimCell_109))) v_arrayElimCell_92))) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))) .cse3) (or (forall ((v_prenex_19 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_37 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse237 (select .cse10 v_arrayElimCell_110))) (let ((.cse238 (select |c_#memory_$Pointer$#1.base| .cse237))) (or (= .cse237 .cse5) (= .cse6 .cse237) (not (= (select .cse238 v_prenex_18) .cse5)) (not (= .cse6 (select (let ((.cse239 (let ((.cse240 (store |c_#memory_$Pointer$#1.base| .cse237 (store .cse238 v_prenex_18 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse240 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse240 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_19))))) (select .cse239 (select (select .cse239 .cse6) v_arrayElimCell_109))) v_prenex_37))))))) .cse21) (or .cse21 (forall ((v_prenex_32 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_34 (_ BitVec 32)) (v_prenex_33 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse242 (select .cse10 v_arrayElimCell_110))) (let ((.cse241 (select |c_#memory_$Pointer$#1.base| .cse242))) (or (not (= (select .cse241 v_prenex_32) .cse5)) (= .cse6 .cse242) (not (= (select (let ((.cse243 (let ((.cse244 (store |c_#memory_$Pointer$#1.base| .cse242 (store .cse241 v_prenex_32 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse244 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse244 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_33))))) (select .cse243 (select (select .cse243 .cse6) v_arrayElimCell_109))) v_prenex_34) .cse6)) (= v_arrayElimCell_110 v_prenex_32)))))) (or (forall ((v_arrayElimCell_94 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse246 (select .cse10 v_arrayElimCell_110))) (let ((.cse245 (select |c_#memory_$Pointer$#1.base| .cse246))) (or (not (= (select .cse245 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (= .cse246 .cse5) (= .cse6 .cse246) (not (= .cse6 (select (let ((.cse247 (let ((.cse248 (store |c_#memory_$Pointer$#1.base| .cse246 (store .cse245 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse248 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse248 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_25))))) (select .cse247 (select (select .cse247 .cse6) v_arrayElimCell_109))) v_arrayElimCell_94))))))) .cse21) (or .cse2 .cse3 (forall ((v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse250 (select .cse10 v_arrayElimCell_110))) (let ((.cse249 (select |c_#memory_$Pointer$#1.base| .cse250))) (or (not (= (select .cse249 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (= .cse250 .cse5) (= .cse6 .cse250) (not (= .cse6 (select (let ((.cse251 (let ((.cse252 (store |c_#memory_$Pointer$#1.base| .cse250 (store .cse249 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse252 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse252 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_14))))) (select .cse251 (select (select .cse251 .cse6) v_arrayElimCell_109))) v_arrayElimCell_92)))))))) (or .cse3 (forall ((v_prenex_16 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse256 (select .cse10 v_arrayElimCell_110))) (let ((.cse253 (select |c_#memory_$Pointer$#1.base| .cse256))) (or (not (= (select .cse253 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse254 (let ((.cse255 (store |c_#memory_$Pointer$#1.base| .cse256 (store .cse253 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse255 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse255 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_16))))) (select .cse254 (select (select .cse254 .cse6) v_arrayElimCell_109))) v_prenex_17))) (= v_arrayElimCell_110 v_arrayElimCell_109) (= .cse6 .cse256) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))) (or (forall ((v_prenex_15 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse260 (select .cse10 v_arrayElimCell_110))) (let ((.cse257 (select |c_#memory_$Pointer$#1.base| .cse260))) (or (not (= (select .cse257 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse258 (let ((.cse259 (store |c_#memory_$Pointer$#1.base| .cse260 (store .cse257 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse259 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse259 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_15))))) (select .cse258 (select (select .cse258 .cse6) v_arrayElimCell_109))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= .cse6 .cse260) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))) .cse3) (or .cse3 (forall ((v_prenex_21 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_38 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse263 (select .cse10 v_arrayElimCell_110))) (let ((.cse264 (select |c_#memory_$Pointer$#1.base| .cse263))) (or (not (= .cse6 (select (let ((.cse261 (let ((.cse262 (store |c_#memory_$Pointer$#1.base| .cse263 (store .cse264 v_prenex_20 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse262 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse262 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_21))))) (select .cse261 (select (select .cse261 .cse6) v_arrayElimCell_109))) v_prenex_38))) (= v_arrayElimCell_110 v_arrayElimCell_109) (= .cse263 .cse5) (= .cse6 .cse263) (not (= (select .cse264 v_prenex_20) .cse5))))))) (or (forall ((v_prenex_30 (_ BitVec 32)) (v_prenex_31 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_29 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse267 (select .cse10 v_arrayElimCell_110))) (let ((.cse268 (select |c_#memory_$Pointer$#1.base| .cse267))) (or (not (= .cse6 (select (let ((.cse265 (let ((.cse266 (store |c_#memory_$Pointer$#1.base| .cse267 (store .cse268 v_prenex_29 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse266 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse266 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_30))))) (select .cse265 (select (select .cse265 .cse6) v_arrayElimCell_109))) v_prenex_31))) (not (= (select .cse268 v_prenex_29) .cse5)) (= v_arrayElimCell_110 v_arrayElimCell_109) (= v_arrayElimCell_110 v_prenex_29) (= .cse6 .cse267))))) .cse3))) (.cse49 (and .cse0 .cse12)) (.cse127 (and (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse192 (select .cse10 v_arrayElimCell_114))) (let ((.cse189 (select |c_#memory_$Pointer$#1.base| .cse192))) (or (not (= (select .cse189 v_prenex_44) .cse5)) (not (= .cse6 (select (let ((.cse190 (let ((.cse191 (store |c_#memory_$Pointer$#1.base| .cse192 (store .cse189 v_prenex_44 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse191 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse191 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_45))))) (select .cse190 (select (select .cse190 .cse6) v_arrayElimCell_113))) v_prenex_44))) (= v_arrayElimCell_113 v_prenex_44) (= .cse192 .cse5))))) .cse3) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_prenex_40 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_39 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (let ((.cse194 (select .cse10 v_arrayElimCell_114))) (let ((.cse193 (select |c_#memory_$Pointer$#1.base| .cse194))) (or (not (= (select .cse193 v_prenex_39) .cse5)) (= v_arrayElimCell_113 v_prenex_39) (= .cse194 .cse5) (not (= .cse6 (select (let ((.cse195 (let ((.cse196 (store |c_#memory_$Pointer$#1.base| .cse194 (store .cse193 v_prenex_39 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse196 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse196 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_40))))) (select .cse195 (select (select .cse195 .cse6) v_arrayElimCell_113))) v_arrayElimCell_92))))))) .cse2 .cse3) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse199 (select .cse10 v_arrayElimCell_114))) (let ((.cse200 (select |c_#memory_$Pointer$#1.base| .cse199))) (or (not (= .cse6 (select (let ((.cse197 (let ((.cse198 (store |c_#memory_$Pointer$#1.base| .cse199 (store .cse200 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse198 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse198 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse197 (select (select .cse197 .cse6) v_arrayElimCell_113))) v_arrayElimCell_94))) (= v_arrayElimCell_113 v_arrayElimIndex_17) (= .cse199 .cse5) (not (= (select .cse200 v_arrayElimIndex_17) .cse5)))))) .cse21) (or .cse3 (forall ((v_prenex_41 (_ BitVec 32)) (v_arrayElimCell_113 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse203 (select .cse10 v_arrayElimCell_114))) (let ((.cse204 (select |c_#memory_$Pointer$#1.base| .cse203))) (or (= v_arrayElimCell_113 v_prenex_41) (not (= (select (let ((.cse201 (let ((.cse202 (store |c_#memory_$Pointer$#1.base| .cse203 (store .cse204 v_prenex_41 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse202 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse202 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_42))))) (select .cse201 (select (select .cse201 .cse6) v_arrayElimCell_113))) v_prenex_43) .cse6)) (= .cse203 .cse5) (not (= (select .cse204 v_prenex_41) .cse5)) (= v_arrayElimCell_113 v_arrayElimCell_114)))))))) (.cse90 (and (or (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse173 (select .cse10 v_arrayElimCell_116))) (let ((.cse174 (select |c_#memory_$Pointer$#1.base| .cse173))) (or (= .cse173 .cse5) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= (select .cse174 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse175 (let ((.cse176 (store |c_#memory_$Pointer$#1.base| .cse173 (store .cse174 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse176 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse176 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse175 (select (select .cse175 .cse6) v_arrayElimCell_115))) v_arrayElimCell_94))))))) .cse21) (or .cse3 (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_prenex_49 (_ BitVec 32)) (v_prenex_48 (_ BitVec 32))) (let ((.cse177 (select .cse10 v_arrayElimCell_116))) (let ((.cse180 (select |c_#memory_$Pointer$#1.base| .cse177))) (or (= .cse177 .cse5) (not (= (select (let ((.cse178 (let ((.cse179 (store |c_#memory_$Pointer$#1.base| .cse177 (store .cse180 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse179 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse179 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_48))))) (select .cse178 (select (select .cse178 .cse6) v_arrayElimCell_115))) v_prenex_49) .cse6)) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= (select .cse180 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (= v_arrayElimCell_115 v_arrayElimCell_116)))))) (or .cse3 (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32))) (let ((.cse181 (select .cse10 v_arrayElimCell_116))) (let ((.cse182 (select |c_#memory_$Pointer$#1.base| .cse181))) (or (= .cse181 .cse5) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= (select .cse182 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse183 (let ((.cse184 (store |c_#memory_$Pointer$#1.base| .cse181 (store .cse182 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse184 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse184 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_47))))) (select .cse183 (select (select .cse183 .cse6) v_arrayElimCell_115))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))))) (or .cse2 (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse185 (select .cse10 v_arrayElimCell_116))) (let ((.cse186 (select |c_#memory_$Pointer$#1.base| .cse185))) (or (= .cse185 .cse5) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= (select .cse186 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse187 (let ((.cse188 (store |c_#memory_$Pointer$#1.base| .cse185 (store .cse186 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse188 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse188 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_46))))) (select .cse187 (select (select .cse187 .cse6) v_arrayElimCell_115))) v_arrayElimCell_92))))))) .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3 (forall ((v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse4 (select .cse10 v_arrayElimCell_110))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse4))) (or (= .cse4 .cse5) (= .cse6 .cse4) (not (= .cse6 (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse9 v_prenex_22 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse8 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_23))))) (select .cse7 (select (select .cse7 .cse6) v_arrayElimCell_110))) v_prenex_24))) (not (= .cse5 (select .cse9 v_prenex_22)))))))) (or (let ((.cse11 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse20 (select .cse10 v_arrayElimCell_108))) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| .cse20))) (or (= v_arrayElimCell_107 v_arrayElimIndex_17) (= v_arrayElimCell_108 v_arrayElimIndex_17) (not (= (select .cse17 v_arrayElimIndex_17) .cse5)) (not (= .cse6 (select (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse20 (store .cse17 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse19 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse19 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse18 (select (select .cse18 .cse6) v_arrayElimCell_107))) v_arrayElimCell_94))))))))) (and (or .cse11 .cse12) (or .cse0 .cse11) (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (let ((.cse15 (select .cse10 v_arrayElimCell_107))) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| .cse15))) (or (= v_arrayElimCell_107 v_arrayElimIndex_17) (forall ((v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (not (= .cse6 (select (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse15 (store .cse16 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse14 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse13 (select (select .cse13 .cse6) v_arrayElimCell_107))) v_arrayElimCell_94)))) (not (= (select .cse16 v_arrayElimIndex_17) .cse5)))))))) .cse21) (or .cse2 .cse3 (forall ((v_prenex_14 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse23 (select .cse10 v_arrayElimCell_110))) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| .cse23))) (or (not (= (select .cse22 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (= .cse6 .cse23) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= .cse6 (select (let ((.cse24 (let ((.cse25 (store |c_#memory_$Pointer$#1.base| .cse23 (store .cse22 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse25 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse25 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_14))))) (select .cse24 (select (select .cse24 .cse6) v_arrayElimCell_110))) v_arrayElimCell_92)))))))) (or .cse3 (forall ((v_prenex_50 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32))) (let ((.cse26 (select .cse10 v_arrayElimCell_118))) (let ((.cse27 (select |c_#memory_$Pointer$#1.base| .cse26))) (or (= .cse26 .cse5) (not (= (select .cse27 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$#1.base| .cse26 (store .cse27 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse29 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse29 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_50))))) (select .cse28 (select (select .cse28 .cse6) v_arrayElimCell_118))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))))) (or .cse30 .cse12) (or .cse3 (let ((.cse35 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_96 (_ BitVec 32)) (v_arrayElimCell_95 (_ BitVec 32))) (let ((.cse39 (select .cse10 v_arrayElimCell_96))) (let ((.cse36 (select |c_#memory_$Pointer$#1.base| .cse39))) (or (= v_arrayElimCell_96 v_arrayElimIndex_17) (not (= (select .cse36 v_arrayElimIndex_17) .cse5)) (not (= .cse6 (select (let ((.cse37 (let ((.cse38 (store |c_#memory_$Pointer$#1.base| .cse39 (store .cse36 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse38 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse38 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse37 (select (select .cse37 .cse6) v_arrayElimCell_95))) v_arrayElimIndex_17))) (= v_arrayElimCell_95 v_arrayElimIndex_17))))))) (and (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_95 (_ BitVec 32))) (let ((.cse33 (select .cse10 v_arrayElimCell_95))) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| .cse33))) (or (forall ((v_ArrVal_536 (_ BitVec 32))) (not (= .cse6 (select (let ((.cse31 (let ((.cse32 (store |c_#memory_$Pointer$#1.base| .cse33 (store .cse34 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse32 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse32 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse31 (select (select .cse31 .cse6) v_arrayElimCell_95))) v_arrayElimIndex_17)))) (= v_arrayElimCell_95 v_arrayElimIndex_17) (not (= (select .cse34 v_arrayElimIndex_17) .cse5)))))) (or .cse0 .cse35) (or .cse35 .cse12)))) (or .cse2 (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_26 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse41 (select .cse10 v_arrayElimCell_110))) (let ((.cse40 (select |c_#memory_$Pointer$#1.base| .cse41))) (or (= v_arrayElimCell_110 v_prenex_26) (not (= (select .cse40 v_prenex_26) .cse5)) (= .cse6 .cse41) (not (= .cse6 (select (let ((.cse42 (let ((.cse43 (store |c_#memory_$Pointer$#1.base| .cse41 (store .cse40 v_prenex_26 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse43 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse43 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_27))))) (select .cse42 (select (select .cse42 .cse6) v_arrayElimCell_110))) v_prenex_28))))))) .cse3) (or .cse44 .cse12) (or .cse3 (forall ((v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse48 (select .cse10 v_arrayElimCell_114))) (let ((.cse45 (select |c_#memory_$Pointer$#1.base| .cse48))) (or (= v_arrayElimCell_114 v_prenex_44) (not (= (select .cse45 v_prenex_44) .cse5)) (not (= .cse6 (select (let ((.cse46 (let ((.cse47 (store |c_#memory_$Pointer$#1.base| .cse48 (store .cse45 v_prenex_44 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse47 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse47 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_45))))) (select .cse46 (select (select .cse46 .cse6) v_arrayElimCell_114))) v_prenex_44))) (= .cse48 .cse5)))))) (or .cse0 .cse30) (or .cse49 (and (or (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (let ((.cse50 (select .cse10 v_arrayElimCell_106))) (let ((.cse51 (select |c_#memory_$Pointer$#1.base| .cse50))) (or (= .cse50 .cse5) (= v_arrayElimCell_105 v_arrayElimCell_106) (not (= (select .cse51 v_prenex_7) .cse5)) (not (= .cse6 (select (let ((.cse52 (let ((.cse53 (store |c_#memory_$Pointer$#1.base| .cse50 (store .cse51 v_prenex_7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse53 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse53 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_8))))) (select .cse52 (select (select .cse52 .cse6) v_arrayElimCell_105))) v_prenex_13))))))) .cse21) (or .cse21 (forall ((v_prenex_10 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse56 (select .cse10 v_arrayElimCell_106))) (let ((.cse57 (select |c_#memory_$Pointer$#1.base| .cse56))) (or (= v_arrayElimCell_106 v_prenex_9) (= v_arrayElimCell_105 v_arrayElimCell_106) (not (= .cse6 (select (let ((.cse54 (let ((.cse55 (store |c_#memory_$Pointer$#1.base| .cse56 (store .cse57 v_prenex_9 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse55 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse55 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_10))))) (select .cse54 (select (select .cse54 .cse6) v_arrayElimCell_105))) v_arrayElimCell_94))) (not (= (select .cse57 v_prenex_9) .cse5))))))) (or .cse3 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (let ((.cse61 (select .cse10 v_arrayElimCell_106))) (let ((.cse58 (select |c_#memory_$Pointer$#1.base| .cse61))) (or (not (= (select .cse58 v_arrayElimIndex_17) .cse5)) (= v_arrayElimCell_105 v_arrayElimCell_106) (not (= .cse6 (select (let ((.cse59 (let ((.cse60 (store |c_#memory_$Pointer$#1.base| .cse61 (store .cse58 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse60 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse60 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse59 (select (select .cse59 .cse6) v_arrayElimCell_105))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= v_arrayElimCell_106 v_arrayElimIndex_17)))))) (or (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse62 (select .cse10 v_arrayElimCell_106))) (let ((.cse65 (select |c_#memory_$Pointer$#1.base| .cse62))) (or (= .cse62 .cse5) (not (= .cse6 (select (let ((.cse63 (let ((.cse64 (store |c_#memory_$Pointer$#1.base| .cse62 (store .cse65 v_prenex_11 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse64 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse64 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_12))))) (select .cse63 (select (select .cse63 .cse6) v_arrayElimCell_105))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= v_arrayElimCell_105 v_arrayElimCell_106) (not (= (select .cse65 v_prenex_11) .cse5)))))) .cse3))) (or .cse2 .cse3 (forall ((v_arrayElimCell_116 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse66 (select .cse10 v_arrayElimCell_116))) (let ((.cse69 (select |c_#memory_$Pointer$#1.base| .cse66))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (= .cse66 .cse5) (not (= .cse6 (select (let ((.cse67 (let ((.cse68 (store |c_#memory_$Pointer$#1.base| .cse66 (store .cse69 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse68 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse68 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_46))))) (select .cse67 (select (select .cse67 .cse6) v_arrayElimCell_116))) v_arrayElimCell_92))) (not (= (select .cse69 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5))))))) (or .cse21 (forall ((v_prenex_32 (_ BitVec 32)) (v_prenex_34 (_ BitVec 32)) (v_prenex_33 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse71 (select .cse10 v_arrayElimCell_110))) (let ((.cse70 (select |c_#memory_$Pointer$#1.base| .cse71))) (or (not (= (select .cse70 v_prenex_32) .cse5)) (= .cse6 .cse71) (= v_arrayElimCell_110 v_prenex_32) (not (= .cse6 (select (let ((.cse72 (let ((.cse73 (store |c_#memory_$Pointer$#1.base| .cse71 (store .cse70 v_prenex_32 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse73 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse73 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_33))))) (select .cse72 (select (select .cse72 .cse6) v_arrayElimCell_110))) v_prenex_34)))))))) (or .cse3 (forall ((v_arrayElimCell_116 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32))) (let ((.cse76 (select .cse10 v_arrayElimCell_116))) (let ((.cse77 (select |c_#memory_$Pointer$#1.base| .cse76))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= .cse6 (select (let ((.cse74 (let ((.cse75 (store |c_#memory_$Pointer$#1.base| .cse76 (store .cse77 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse75 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse75 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_47))))) (select .cse74 (select (select .cse74 .cse6) v_arrayElimCell_116))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (not (= (select .cse77 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5))))))) (or .cse2 (forall ((v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (let ((.cse81 (select .cse10 v_arrayElimCell_112))) (let ((.cse78 (select |c_#memory_$Pointer$#1.base| .cse81))) (or (= v_arrayElimCell_111 v_arrayElimIndex_17) (= v_arrayElimCell_112 v_arrayElimIndex_17) (not (= (select .cse78 v_arrayElimIndex_17) .cse5)) (not (= .cse6 (select (let ((.cse79 (let ((.cse80 (store |c_#memory_$Pointer$#1.base| .cse81 (store .cse78 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse80 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse80 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse79 (select (select .cse79 .cse6) v_arrayElimCell_111))) v_arrayElimCell_92))))))) .cse3) (or (forall ((v_prenex_50 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32))) (let ((.cse85 (select .cse10 v_arrayElimCell_118))) (let ((.cse82 (select |c_#memory_$Pointer$#1.base| .cse85))) (or (= v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= (select .cse82 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse83 (let ((.cse84 (store |c_#memory_$Pointer$#1.base| .cse85 (store .cse82 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse84 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse84 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_50))))) (select .cse83 (select (select .cse83 .cse6) v_arrayElimCell_118))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))))) .cse3) (or (forall ((v_arrayElimCell_94 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse89 (select .cse10 v_arrayElimCell_110))) (let ((.cse86 (select |c_#memory_$Pointer$#1.base| .cse89))) (or (not (= (select .cse86 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse87 (let ((.cse88 (store |c_#memory_$Pointer$#1.base| .cse89 (store .cse86 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse88 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse88 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_25))))) (select .cse87 (select (select .cse87 .cse6) v_arrayElimCell_110))) v_arrayElimCell_94))) (= .cse89 .cse5) (= .cse6 .cse89))))) .cse21) (or .cse90 .cse12) (or .cse2 .cse3 (forall ((v_prenex_40 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_39 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (let ((.cse94 (select .cse10 v_arrayElimCell_114))) (let ((.cse91 (select |c_#memory_$Pointer$#1.base| .cse94))) (or (not (= (select .cse91 v_prenex_39) .cse5)) (not (= .cse6 (select (let ((.cse92 (let ((.cse93 (store |c_#memory_$Pointer$#1.base| .cse94 (store .cse91 v_prenex_39 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse93 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse93 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_40))))) (select .cse92 (select (select .cse92 .cse6) v_arrayElimCell_114))) v_arrayElimCell_92))) (= .cse94 .cse5) (= v_arrayElimCell_114 v_prenex_39)))))) (or .cse2 .cse3 (forall ((v_prenex_14 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse96 (select .cse10 v_arrayElimCell_110))) (let ((.cse95 (select |c_#memory_$Pointer$#1.base| .cse96))) (or (not (= (select .cse95 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (= .cse96 .cse5) (= .cse6 .cse96) (not (= .cse6 (select (let ((.cse97 (let ((.cse98 (store |c_#memory_$Pointer$#1.base| .cse96 (store .cse95 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse98 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse98 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_14))))) (select .cse97 (select (select .cse97 .cse6) v_arrayElimCell_110))) v_arrayElimCell_92)))))))) (or .cse3 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse101 (select .cse10 v_arrayElimCell_110))) (let ((.cse102 (select |c_#memory_$Pointer$#1.base| .cse101))) (or (not (= .cse6 (select (let ((.cse99 (let ((.cse100 (store |c_#memory_$Pointer$#1.base| .cse101 (store .cse102 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse100 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse100 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse99 (select (select .cse99 .cse6) v_arrayElimCell_110))) v_arrayElimIndex_17))) (= .cse6 .cse101) (= v_arrayElimCell_110 v_arrayElimIndex_17) (not (= (select .cse102 v_arrayElimIndex_17) .cse5))))))) (or .cse3 (forall ((v_arrayElimCell_116 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32))) (let ((.cse103 (select .cse10 v_arrayElimCell_116))) (let ((.cse106 (select |c_#memory_$Pointer$#1.base| .cse103))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (= .cse103 .cse5) (not (= .cse6 (select (let ((.cse104 (let ((.cse105 (store |c_#memory_$Pointer$#1.base| .cse103 (store .cse106 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse105 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse105 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_47))))) (select .cse104 (select (select .cse104 .cse6) v_arrayElimCell_116))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (not (= (select .cse106 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5))))))) (or .cse21 (forall ((v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse109 (select .cse10 v_arrayElimCell_118))) (let ((.cse110 (select |c_#memory_$Pointer$#1.base| .cse109))) (or (= v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= .cse6 (select (let ((.cse107 (let ((.cse108 (store |c_#memory_$Pointer$#1.base| .cse109 (store .cse110 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse108 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse108 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse107 (select (select .cse107 .cse6) v_arrayElimCell_118))) v_arrayElimCell_94))) (not (= (select .cse110 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5))))))) (or (forall ((v_prenex_15 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse114 (select .cse10 v_arrayElimCell_110))) (let ((.cse111 (select |c_#memory_$Pointer$#1.base| .cse114))) (or (not (= (select .cse111 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse112 (let ((.cse113 (store |c_#memory_$Pointer$#1.base| .cse114 (store .cse111 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse113 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse113 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_15))))) (select .cse112 (select (select .cse112 .cse6) v_arrayElimCell_110))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= .cse6 .cse114) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))) .cse3) (or .cse21 (forall ((v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse117 (select .cse10 v_arrayElimCell_118))) (let ((.cse118 (select |c_#memory_$Pointer$#1.base| .cse117))) (or (not (= .cse6 (select (let ((.cse115 (let ((.cse116 (store |c_#memory_$Pointer$#1.base| .cse117 (store .cse118 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse116 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse116 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse115 (select (select .cse115 .cse6) v_arrayElimCell_118))) v_arrayElimCell_94))) (= .cse117 .cse5) (not (= (select .cse118 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5))))))) (or (forall ((v_arrayElimCell_116 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse121 (select .cse10 v_arrayElimCell_116))) (let ((.cse122 (select |c_#memory_$Pointer$#1.base| .cse121))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= .cse6 (select (let ((.cse119 (let ((.cse120 (store |c_#memory_$Pointer$#1.base| .cse121 (store .cse122 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse120 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse120 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse119 (select (select .cse119 .cse6) v_arrayElimCell_116))) v_arrayElimCell_94))) (not (= (select .cse122 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)))))) .cse21) (or (forall ((v_prenex_19 (_ BitVec 32)) (v_prenex_37 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse125 (select .cse10 v_arrayElimCell_110))) (let ((.cse126 (select |c_#memory_$Pointer$#1.base| .cse125))) (or (not (= .cse6 (select (let ((.cse123 (let ((.cse124 (store |c_#memory_$Pointer$#1.base| .cse125 (store .cse126 v_prenex_18 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse124 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse124 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_19))))) (select .cse123 (select (select .cse123 .cse6) v_arrayElimCell_110))) v_prenex_37))) (= .cse125 .cse5) (= .cse6 .cse125) (not (= (select .cse126 v_prenex_18) .cse5)))))) .cse21) (or .cse1 .cse12) (or .cse0 .cse44) (or .cse0 .cse127) (or .cse128 .cse12) (or (forall ((v_arrayElimCell_116 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse131 (select .cse10 v_arrayElimCell_116))) (let ((.cse132 (select |c_#memory_$Pointer$#1.base| .cse131))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (not (= .cse6 (select (let ((.cse129 (let ((.cse130 (store |c_#memory_$Pointer$#1.base| .cse131 (store .cse132 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse130 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse130 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_46))))) (select .cse129 (select (select .cse129 .cse6) v_arrayElimCell_116))) v_arrayElimCell_92))) (not (= (select .cse132 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)))))) .cse2 .cse3) (or .cse0 .cse128) (or .cse21 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse135 (select .cse10 v_arrayElimCell_114))) (let ((.cse136 (select |c_#memory_$Pointer$#1.base| .cse135))) (or (= v_arrayElimCell_114 v_arrayElimIndex_17) (not (= .cse6 (select (let ((.cse133 (let ((.cse134 (store |c_#memory_$Pointer$#1.base| .cse135 (store .cse136 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse134 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse134 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse133 (select (select .cse133 .cse6) v_arrayElimCell_114))) v_arrayElimCell_94))) (= .cse135 .cse5) (not (= (select .cse136 v_arrayElimIndex_17) .cse5))))))) (or (forall ((v_arrayElimCell_94 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse140 (select .cse10 v_arrayElimCell_110))) (let ((.cse137 (select |c_#memory_$Pointer$#1.base| .cse140))) (or (not (= (select .cse137 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse138 (let ((.cse139 (store |c_#memory_$Pointer$#1.base| .cse140 (store .cse137 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse139 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse139 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_25))))) (select .cse138 (select (select .cse138 .cse6) v_arrayElimCell_110))) v_arrayElimCell_94))) (= .cse6 .cse140) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))) .cse21) (or .cse3 (forall ((v_prenex_15 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse144 (select .cse10 v_arrayElimCell_110))) (let ((.cse141 (select |c_#memory_$Pointer$#1.base| .cse144))) (or (not (= (select .cse141 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5)) (not (= .cse6 (select (let ((.cse142 (let ((.cse143 (store |c_#memory_$Pointer$#1.base| .cse144 (store .cse141 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse143 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse143 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_15))))) (select .cse142 (select (select .cse142 .cse6) v_arrayElimCell_110))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= .cse144 .cse5) (= .cse6 .cse144)))))) (or .cse3 .cse49 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (let ((.cse147 (select .cse10 v_arrayElimCell_98))) (let ((.cse148 (select |c_#memory_$Pointer$#1.base| .cse147))) (or (not (= .cse6 (select (let ((.cse145 (let ((.cse146 (store |c_#memory_$Pointer$#1.base| .cse147 (store .cse148 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse146 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse146 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse145 (select (select .cse145 .cse6) v_arrayElimCell_97))) v_arrayElimCell_92))) (= v_arrayElimCell_98 v_arrayElimIndex_17) (= v_arrayElimCell_97 v_arrayElimCell_98) (not (= (select .cse148 v_arrayElimIndex_17) .cse5)) (= v_arrayElimCell_97 v_arrayElimIndex_17)))))) (or .cse21 (forall ((v_arrayElimCell_116 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse149 (select .cse10 v_arrayElimCell_116))) (let ((.cse152 (select |c_#memory_$Pointer$#1.base| .cse149))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (= .cse149 .cse5) (not (= .cse6 (select (let ((.cse150 (let ((.cse151 (store |c_#memory_$Pointer$#1.base| .cse149 (store .cse152 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse151 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse151 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse150 (select (select .cse150 .cse6) v_arrayElimCell_116))) v_arrayElimCell_94))) (not (= (select .cse152 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse5))))))) (or .cse3 (forall ((v_prenex_36 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse155 (select .cse10 v_arrayElimCell_110))) (let ((.cse156 (select |c_#memory_$Pointer$#1.base| .cse155))) (or (not (= (select (let ((.cse153 (let ((.cse154 (store |c_#memory_$Pointer$#1.base| .cse155 (store .cse156 v_prenex_35 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse154 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse154 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_36))))) (select .cse153 (select (select .cse153 .cse6) v_arrayElimCell_110))) v_prenex_35) .cse6)) (= .cse155 .cse5) (= .cse6 .cse155) (not (= (select .cse156 v_prenex_35) .cse5))))))) (or .cse127 .cse12) (or .cse2 (and (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_103 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse160 (select .cse10 v_arrayElimCell_104))) (let ((.cse157 (select |c_#memory_$Pointer$#1.base| .cse160))) (or (not (= (select .cse157 v_arrayElimIndex_17) .cse5)) (= v_arrayElimCell_104 v_arrayElimIndex_17) (not (= .cse6 (select (let ((.cse158 (let ((.cse159 (store |c_#memory_$Pointer$#1.base| .cse160 (store .cse157 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse159 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse159 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse158 (select (select .cse158 .cse6) v_arrayElimCell_103))) v_arrayElimCell_94))))))) .cse21) (or .cse3 (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_101 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32))) (let ((.cse164 (select .cse10 v_arrayElimCell_102))) (let ((.cse161 (select |c_#memory_$Pointer$#1.base| .cse164))) (or (not (= (select .cse161 v_arrayElimIndex_17) .cse5)) (not (= .cse6 (select (let ((.cse162 (let ((.cse163 (store |c_#memory_$Pointer$#1.base| .cse164 (store .cse161 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse163 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse163 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse162 (select (select .cse162 .cse6) v_arrayElimCell_101))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= .cse164 .cse5)))))) (or .cse3 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_99 (_ BitVec 32)) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse167 (select .cse10 v_arrayElimCell_100))) (let ((.cse168 (select |c_#memory_$Pointer$#1.base| .cse167))) (or (= v_arrayElimCell_100 v_arrayElimIndex_17) (not (= .cse6 (select (let ((.cse165 (let ((.cse166 (store |c_#memory_$Pointer$#1.base| .cse167 (store .cse168 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse166 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse166 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_536))))) (select .cse165 (select (select .cse165 .cse6) v_arrayElimCell_99))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (not (= (select .cse168 v_arrayElimIndex_17) .cse5))))))) (or .cse21 (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_101 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (let ((.cse169 (select .cse10 v_arrayElimCell_102))) (let ((.cse172 (select |c_#memory_$Pointer$#1.base| .cse169))) (or (= .cse169 .cse5) (not (= .cse6 (select (let ((.cse170 (let ((.cse171 (store |c_#memory_$Pointer$#1.base| .cse169 (store .cse172 v_prenex_5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse171 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse171 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_prenex_6))))) (select .cse170 (select (select .cse170 .cse6) v_arrayElimCell_101))) v_arrayElimCell_94))) (not (= .cse5 (select .cse172 v_prenex_5)))))))))) (or .cse0 .cse90)))))) is different from true [2024-11-27 20:16:05,336 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (= .cse5 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse16 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse2 (= .cse5 .cse4)) (.cse35 (not .cse10)) (.cse9 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse1 (and (or (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse288 (select .cse9 v_arrayElimCell_116))) (let ((.cse285 (select |c_#memory_$Pointer$#1.base| .cse288))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (not (= (select .cse285 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (not (= .cse5 (select (let ((.cse286 (let ((.cse287 (store |c_#memory_$Pointer$#1.base| .cse288 (store .cse285 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse287 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse287 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_46))))) (select .cse286 (select (select .cse286 .cse5) v_arrayElimCell_115))) v_arrayElimCell_92))))))) .cse2 .cse10) (or (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_prenex_49 (_ BitVec 32)) (v_prenex_48 (_ BitVec 32))) (let ((.cse292 (select .cse9 v_arrayElimCell_116))) (let ((.cse289 (select |c_#memory_$Pointer$#1.base| .cse292))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (not (= (select .cse289 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (= v_arrayElimCell_115 v_arrayElimCell_116) (not (= .cse5 (select (let ((.cse290 (let ((.cse291 (store |c_#memory_$Pointer$#1.base| .cse292 (store .cse289 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse291 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse291 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_48))))) (select .cse290 (select (select .cse290 .cse5) v_arrayElimCell_115))) v_prenex_49))))))) .cse10) (or (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse295 (select .cse9 v_arrayElimCell_116))) (let ((.cse296 (select |c_#memory_$Pointer$#1.base| .cse295))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (not (= .cse5 (select (let ((.cse293 (let ((.cse294 (store |c_#memory_$Pointer$#1.base| .cse295 (store .cse296 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse294 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse294 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse293 (select (select .cse293 .cse5) v_arrayElimCell_115))) v_arrayElimCell_94))) (not (= (select .cse296 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) .cse35) (or (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32))) (let ((.cse300 (select .cse9 v_arrayElimCell_116))) (let ((.cse297 (select |c_#memory_$Pointer$#1.base| .cse300))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (not (= (select .cse297 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (not (= (select (let ((.cse298 (let ((.cse299 (store |c_#memory_$Pointer$#1.base| .cse300 (store .cse297 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse299 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse299 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_47))))) (select .cse298 (select (select .cse298 .cse5) v_arrayElimCell_115))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse5)) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) .cse10))) (.cse15 (and (or (forall ((v_prenex_30 (_ BitVec 32)) (v_prenex_31 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_29 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse223 (select .cse9 v_arrayElimCell_110))) (let ((.cse224 (select |c_#memory_$Pointer$#1.base| .cse223))) (or (not (= .cse5 (select (let ((.cse221 (let ((.cse222 (store |c_#memory_$Pointer$#1.base| .cse223 (store .cse224 v_prenex_29 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse222 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse222 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_30))))) (select .cse221 (select (select .cse221 .cse5) v_arrayElimCell_109))) v_prenex_31))) (not (= (select .cse224 v_prenex_29) .cse4)) (= v_arrayElimCell_110 v_arrayElimCell_109) (= v_arrayElimCell_110 v_prenex_29) (= .cse5 .cse223))))) .cse10) (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse227 (select .cse9 v_arrayElimCell_110))) (let ((.cse228 (select |c_#memory_$Pointer$#1.base| .cse227))) (or (not (= .cse5 (select (let ((.cse225 (let ((.cse226 (store |c_#memory_$Pointer$#1.base| .cse227 (store .cse228 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse226 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse226 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse225 (select (select .cse225 .cse5) v_arrayElimCell_109))) v_arrayElimIndex_17))) (= .cse5 .cse227) (= v_arrayElimCell_110 v_arrayElimIndex_17) (not (= (select .cse228 v_arrayElimIndex_17) .cse4)))))) .cse10) (or .cse35 (forall ((v_arrayElimCell_94 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse231 (select .cse9 v_arrayElimCell_110))) (let ((.cse232 (select |c_#memory_$Pointer$#1.base| .cse231))) (or (not (= .cse5 (select (let ((.cse229 (let ((.cse230 (store |c_#memory_$Pointer$#1.base| .cse231 (store .cse232 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse230 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse230 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_25))))) (select .cse229 (select (select .cse229 .cse5) v_arrayElimCell_109))) v_arrayElimCell_94))) (= .cse5 .cse231) (not (= (select .cse232 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)))))) (or .cse2 (forall ((v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse235 (select .cse9 v_arrayElimCell_110))) (let ((.cse236 (select |c_#memory_$Pointer$#1.base| .cse235))) (or (not (= .cse5 (select (let ((.cse233 (let ((.cse234 (store |c_#memory_$Pointer$#1.base| .cse235 (store .cse236 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse234 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse234 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_14))))) (select .cse233 (select (select .cse233 .cse5) v_arrayElimCell_109))) v_arrayElimCell_92))) (= .cse235 .cse4) (= .cse5 .cse235) (not (= (select .cse236 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)))))) .cse10) (or (forall ((v_prenex_15 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse239 (select .cse9 v_arrayElimCell_110))) (let ((.cse240 (select |c_#memory_$Pointer$#1.base| .cse239))) (or (not (= (select (let ((.cse237 (let ((.cse238 (store |c_#memory_$Pointer$#1.base| .cse239 (store .cse240 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse238 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse238 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_15))))) (select .cse237 (select (select .cse237 .cse5) v_arrayElimCell_109))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse5)) (= .cse239 .cse4) (= .cse5 .cse239) (not (= (select .cse240 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)))))) .cse10) (or (forall ((v_prenex_15 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse243 (select .cse9 v_arrayElimCell_110))) (let ((.cse244 (select |c_#memory_$Pointer$#1.base| .cse243))) (or (not (= (select (let ((.cse241 (let ((.cse242 (store |c_#memory_$Pointer$#1.base| .cse243 (store .cse244 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse242 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse242 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_15))))) (select .cse241 (select (select .cse241 .cse5) v_arrayElimCell_109))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse5)) (= .cse5 .cse243) (not (= (select .cse244 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) .cse10) (or (forall ((v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse245 (select .cse9 v_arrayElimCell_110))) (let ((.cse246 (select |c_#memory_$Pointer$#1.base| .cse245))) (or (= .cse245 .cse4) (= .cse5 .cse245) (not (= (select .cse246 v_prenex_35) .cse4)) (not (= .cse5 (select (let ((.cse247 (let ((.cse248 (store |c_#memory_$Pointer$#1.base| .cse245 (store .cse246 v_prenex_35 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse248 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse248 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_36))))) (select .cse247 (select (select .cse247 .cse5) v_arrayElimCell_109))) v_prenex_35))))))) .cse10) (or .cse35 (forall ((v_arrayElimCell_94 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse249 (select .cse9 v_arrayElimCell_110))) (let ((.cse252 (select |c_#memory_$Pointer$#1.base| .cse249))) (or (= .cse249 .cse4) (not (= .cse5 (select (let ((.cse250 (let ((.cse251 (store |c_#memory_$Pointer$#1.base| .cse249 (store .cse252 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse251 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse251 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_25))))) (select .cse250 (select (select .cse250 .cse5) v_arrayElimCell_109))) v_arrayElimCell_94))) (= .cse5 .cse249) (not (= (select .cse252 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4))))))) (or (forall ((v_prenex_19 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_37 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse253 (select .cse9 v_arrayElimCell_110))) (let ((.cse256 (select |c_#memory_$Pointer$#1.base| .cse253))) (or (= .cse253 .cse4) (not (= (select (let ((.cse254 (let ((.cse255 (store |c_#memory_$Pointer$#1.base| .cse253 (store .cse256 v_prenex_18 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse255 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse255 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_19))))) (select .cse254 (select (select .cse254 .cse5) v_arrayElimCell_109))) v_prenex_37) .cse5)) (= .cse5 .cse253) (not (= (select .cse256 v_prenex_18) .cse4)))))) .cse35) (or .cse10 (forall ((v_prenex_21 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_38 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse259 (select .cse9 v_arrayElimCell_110))) (let ((.cse260 (select |c_#memory_$Pointer$#1.base| .cse259))) (or (not (= .cse5 (select (let ((.cse257 (let ((.cse258 (store |c_#memory_$Pointer$#1.base| .cse259 (store .cse260 v_prenex_20 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse258 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse258 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_21))))) (select .cse257 (select (select .cse257 .cse5) v_arrayElimCell_109))) v_prenex_38))) (= v_arrayElimCell_110 v_arrayElimCell_109) (= .cse259 .cse4) (= .cse5 .cse259) (not (= (select .cse260 v_prenex_20) .cse4))))))) (or .cse2 (forall ((v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse261 (select .cse9 v_arrayElimCell_110))) (let ((.cse262 (select |c_#memory_$Pointer$#1.base| .cse261))) (or (= .cse261 .cse4) (= .cse5 .cse261) (not (= .cse4 (select .cse262 v_prenex_22))) (not (= .cse5 (select (let ((.cse263 (let ((.cse264 (store |c_#memory_$Pointer$#1.base| .cse261 (store .cse262 v_prenex_22 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse264 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse264 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_23))))) (select .cse263 (select (select .cse263 .cse5) v_arrayElimCell_109))) v_prenex_24))))))) .cse10) (or .cse2 (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_26 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse266 (select .cse9 v_arrayElimCell_110))) (let ((.cse265 (select |c_#memory_$Pointer$#1.base| .cse266))) (or (= v_arrayElimCell_110 v_prenex_26) (not (= (select .cse265 v_prenex_26) .cse4)) (= .cse5 .cse266) (not (= .cse5 (select (let ((.cse267 (let ((.cse268 (store |c_#memory_$Pointer$#1.base| .cse266 (store .cse265 v_prenex_26 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse268 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse268 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_27))))) (select .cse267 (select (select .cse267 .cse5) v_arrayElimCell_109))) v_prenex_28))))))) .cse10) (or (forall ((v_prenex_16 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse271 (select .cse9 v_arrayElimCell_110))) (let ((.cse272 (select |c_#memory_$Pointer$#1.base| .cse271))) (or (= v_arrayElimCell_110 v_arrayElimCell_109) (not (= .cse5 (select (let ((.cse269 (let ((.cse270 (store |c_#memory_$Pointer$#1.base| .cse271 (store .cse272 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse270 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse270 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_16))))) (select .cse269 (select (select .cse269 .cse5) v_arrayElimCell_109))) v_prenex_17))) (= .cse5 .cse271) (not (= (select .cse272 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) .cse10) (or (forall ((v_prenex_32 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_34 (_ BitVec 32)) (v_prenex_33 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse275 (select .cse9 v_arrayElimCell_110))) (let ((.cse276 (select |c_#memory_$Pointer$#1.base| .cse275))) (or (not (= .cse5 (select (let ((.cse273 (let ((.cse274 (store |c_#memory_$Pointer$#1.base| .cse275 (store .cse276 v_prenex_32 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse274 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse274 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_33))))) (select .cse273 (select (select .cse273 .cse5) v_arrayElimCell_109))) v_prenex_34))) (not (= (select .cse276 v_prenex_32) .cse4)) (= .cse5 .cse275) (= v_arrayElimCell_110 v_prenex_32))))) .cse35) (or .cse2 (forall ((v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse279 (select .cse9 v_arrayElimCell_110))) (let ((.cse280 (select |c_#memory_$Pointer$#1.base| .cse279))) (or (not (= .cse5 (select (let ((.cse277 (let ((.cse278 (store |c_#memory_$Pointer$#1.base| .cse279 (store .cse280 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse278 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse278 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_14))))) (select .cse277 (select (select .cse277 .cse5) v_arrayElimCell_109))) v_arrayElimCell_92))) (= .cse5 .cse279) (not (= (select .cse280 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) .cse10) (or (forall ((v_prenex_16 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse281 (select .cse9 v_arrayElimCell_110))) (let ((.cse284 (select |c_#memory_$Pointer$#1.base| .cse281))) (or (= v_arrayElimCell_110 v_arrayElimCell_109) (= .cse281 .cse4) (not (= .cse5 (select (let ((.cse282 (let ((.cse283 (store |c_#memory_$Pointer$#1.base| .cse281 (store .cse284 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse283 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse283 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_16))))) (select .cse282 (select (select .cse282 .cse5) v_arrayElimCell_109))) v_prenex_17))) (= .cse5 .cse281) (not (= (select .cse284 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)))))) .cse10))) (.cse57 (and (or .cse35 (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse205 (select .cse9 v_arrayElimCell_116))) (let ((.cse208 (select |c_#memory_$Pointer$#1.base| .cse205))) (or (= .cse205 .cse4) (not (= .cse5 (select (let ((.cse206 (let ((.cse207 (store |c_#memory_$Pointer$#1.base| .cse205 (store .cse208 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse207 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse207 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse206 (select (select .cse206 .cse5) v_arrayElimCell_115))) v_arrayElimCell_94))) (not (= (select .cse208 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)))))) (or (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_prenex_49 (_ BitVec 32)) (v_prenex_48 (_ BitVec 32))) (let ((.cse209 (select .cse9 v_arrayElimCell_116))) (let ((.cse210 (select |c_#memory_$Pointer$#1.base| .cse209))) (or (= .cse209 .cse4) (not (= (select .cse210 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (= v_arrayElimCell_115 v_arrayElimCell_116) (not (= .cse5 (select (let ((.cse211 (let ((.cse212 (store |c_#memory_$Pointer$#1.base| .cse209 (store .cse210 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse212 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse212 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_48))))) (select .cse211 (select (select .cse211 .cse5) v_arrayElimCell_115))) v_prenex_49))))))) .cse10) (or .cse2 (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse213 (select .cse9 v_arrayElimCell_116))) (let ((.cse214 (select |c_#memory_$Pointer$#1.base| .cse213))) (or (= .cse213 .cse4) (not (= (select .cse214 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (not (= .cse5 (select (let ((.cse215 (let ((.cse216 (store |c_#memory_$Pointer$#1.base| .cse213 (store .cse214 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse216 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse216 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_46))))) (select .cse215 (select (select .cse215 .cse5) v_arrayElimCell_115))) v_arrayElimCell_92))))))) .cse10) (or (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_116 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32))) (let ((.cse217 (select .cse9 v_arrayElimCell_116))) (let ((.cse218 (select |c_#memory_$Pointer$#1.base| .cse217))) (or (= .cse217 .cse4) (not (= (select .cse218 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (not (= (select (let ((.cse219 (let ((.cse220 (store |c_#memory_$Pointer$#1.base| .cse217 (store .cse218 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse220 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse220 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_47))))) (select .cse219 (select (select .cse219 .cse5) v_arrayElimCell_115))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse5)) (= v_arrayElimCell_115 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) .cse10))) (.cse17 (and .cse0 .cse16)) (.cse78 (and (or (forall ((v_arrayElimCell_117 (_ BitVec 32)) (v_prenex_50 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32))) (let ((.cse200 (select .cse9 v_arrayElimCell_118))) (let ((.cse197 (select |c_#memory_$Pointer$#1.base| .cse200))) (or (not (= (select .cse197 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (not (= .cse5 (select (let ((.cse198 (let ((.cse199 (store |c_#memory_$Pointer$#1.base| .cse200 (store .cse197 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse199 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse199 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_50))))) (select .cse198 (select (select .cse198 .cse5) v_arrayElimCell_117))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))) (= v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) .cse10) (or (forall ((v_arrayElimCell_117 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse204 (select .cse9 v_arrayElimCell_118))) (let ((.cse201 (select |c_#memory_$Pointer$#1.base| .cse204))) (or (not (= (select .cse201 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (not (= .cse5 (select (let ((.cse202 (let ((.cse203 (store |c_#memory_$Pointer$#1.base| .cse204 (store .cse201 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse203 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse203 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse202 (select (select .cse202 .cse5) v_arrayElimCell_117))) v_arrayElimCell_94))) (= v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) .cse35))) (.cse40 (and (or (forall ((v_prenex_41 (_ BitVec 32)) (v_arrayElimCell_113 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse183 (select .cse9 v_arrayElimCell_114))) (let ((.cse184 (select |c_#memory_$Pointer$#1.base| .cse183))) (or (= v_arrayElimCell_113 v_prenex_41) (not (= .cse5 (select (let ((.cse181 (let ((.cse182 (store |c_#memory_$Pointer$#1.base| .cse183 (store .cse184 v_prenex_41 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse182 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse182 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_42))))) (select .cse181 (select (select .cse181 .cse5) v_arrayElimCell_113))) v_prenex_43))) (= .cse183 .cse4) (not (= (select .cse184 v_prenex_41) .cse4)) (= v_arrayElimCell_113 v_arrayElimCell_114))))) .cse10) (or .cse2 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_prenex_40 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_39 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (let ((.cse188 (select .cse9 v_arrayElimCell_114))) (let ((.cse185 (select |c_#memory_$Pointer$#1.base| .cse188))) (or (not (= (select .cse185 v_prenex_39) .cse4)) (= v_arrayElimCell_113 v_prenex_39) (not (= .cse5 (select (let ((.cse186 (let ((.cse187 (store |c_#memory_$Pointer$#1.base| .cse188 (store .cse185 v_prenex_39 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse187 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse187 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_40))))) (select .cse186 (select (select .cse186 .cse5) v_arrayElimCell_113))) v_arrayElimCell_92))) (= .cse188 .cse4))))) .cse10) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse191 (select .cse9 v_arrayElimCell_114))) (let ((.cse192 (select |c_#memory_$Pointer$#1.base| .cse191))) (or (= v_arrayElimCell_113 v_arrayElimIndex_17) (not (= .cse5 (select (let ((.cse189 (let ((.cse190 (store |c_#memory_$Pointer$#1.base| .cse191 (store .cse192 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse190 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse190 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse189 (select (select .cse189 .cse5) v_arrayElimCell_113))) v_arrayElimCell_94))) (= .cse191 .cse4) (not (= (select .cse192 v_arrayElimIndex_17) .cse4)))))) .cse35) (or .cse10 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse196 (select .cse9 v_arrayElimCell_114))) (let ((.cse193 (select |c_#memory_$Pointer$#1.base| .cse196))) (or (not (= (select .cse193 v_prenex_44) .cse4)) (= v_arrayElimCell_113 v_prenex_44) (not (= (select (let ((.cse194 (let ((.cse195 (store |c_#memory_$Pointer$#1.base| .cse196 (store .cse193 v_prenex_44 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse195 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse195 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_45))))) (select .cse194 (select (select .cse194 .cse5) v_arrayElimCell_113))) v_prenex_44) .cse5)) (= .cse196 .cse4)))))))) (.cse132 (and (or (forall ((v_arrayElimCell_117 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse176 (select .cse9 v_arrayElimCell_118))) (let ((.cse173 (select |c_#memory_$Pointer$#1.base| .cse176))) (or (not (= (select .cse173 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (not (= .cse5 (select (let ((.cse174 (let ((.cse175 (store |c_#memory_$Pointer$#1.base| .cse176 (store .cse173 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse175 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse175 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse174 (select (select .cse174 .cse5) v_arrayElimCell_117))) v_arrayElimCell_94))) (= .cse176 .cse4))))) .cse35) (or (forall ((v_arrayElimCell_117 (_ BitVec 32)) (v_prenex_50 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32))) (let ((.cse180 (select .cse9 v_arrayElimCell_118))) (let ((.cse177 (select |c_#memory_$Pointer$#1.base| .cse180))) (or (not (= (select .cse177 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (not (= .cse5 (select (let ((.cse178 (let ((.cse179 (store |c_#memory_$Pointer$#1.base| .cse180 (store .cse177 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse179 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse179 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_50))))) (select .cse178 (select (select .cse178 .cse5) v_arrayElimCell_117))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))) (= .cse180 .cse4))))) .cse10)))) (and (or .cse0 .cse1) (or .cse2 (forall ((v_prenex_40 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_39 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (let ((.cse8 (select .cse9 v_arrayElimCell_114))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse8))) (or (not (= (select .cse3 v_prenex_39) .cse4)) (not (= .cse5 (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse3 v_prenex_39 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse7 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_40))))) (select .cse6 (select (select .cse6 .cse5) v_arrayElimCell_114))) v_arrayElimCell_92))) (= .cse8 .cse4) (= v_arrayElimCell_114 v_prenex_39))))) .cse10) (or (forall ((v_prenex_15 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse13 (select .cse9 v_arrayElimCell_110))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse13))) (or (not (= .cse5 (select (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse13 (store .cse14 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse12 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_15))))) (select .cse11 (select (select .cse11 .cse5) v_arrayElimCell_110))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))) (= .cse5 .cse13) (not (= (select .cse14 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) .cse10) (or .cse15 .cse16) (or .cse17 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (let ((.cse20 (select .cse9 v_arrayElimCell_98))) (let ((.cse21 (select |c_#memory_$Pointer$#1.base| .cse20))) (or (= v_arrayElimCell_98 v_arrayElimIndex_17) (= v_arrayElimCell_97 v_arrayElimCell_98) (not (= .cse5 (select (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse20 (store .cse21 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse19 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse19 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse18 (select (select .cse18 .cse5) v_arrayElimCell_97))) v_arrayElimCell_92))) (not (= (select .cse21 v_arrayElimIndex_17) .cse4)) (= v_arrayElimCell_97 v_arrayElimIndex_17))))) .cse10) (or .cse2 (forall ((v_prenex_14 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse22 (select .cse9 v_arrayElimCell_110))) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| .cse22))) (or (= .cse22 .cse4) (= .cse5 .cse22) (not (= (select .cse23 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (not (= .cse5 (select (let ((.cse24 (let ((.cse25 (store |c_#memory_$Pointer$#1.base| .cse22 (store .cse23 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse25 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse25 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_14))))) (select .cse24 (select (select .cse24 .cse5) v_arrayElimCell_110))) v_arrayElimCell_92))))))) .cse10) (or (let ((.cse26 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse33 (select .cse9 v_arrayElimCell_108))) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| .cse33))) (or (= v_arrayElimCell_107 v_arrayElimIndex_17) (= v_arrayElimCell_108 v_arrayElimIndex_17) (not (= .cse5 (select (let ((.cse31 (let ((.cse32 (store |c_#memory_$Pointer$#1.base| .cse33 (store .cse34 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse32 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse32 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse31 (select (select .cse31 .cse5) v_arrayElimCell_107))) v_arrayElimCell_94))) (not (= (select .cse34 v_arrayElimIndex_17) .cse4)))))))) (and (or .cse0 .cse26) (or .cse26 .cse16) (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (let ((.cse29 (select .cse9 v_arrayElimCell_107))) (let ((.cse30 (select |c_#memory_$Pointer$#1.base| .cse29))) (or (= v_arrayElimCell_107 v_arrayElimIndex_17) (forall ((v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (not (= (select (let ((.cse27 (let ((.cse28 (store |c_#memory_$Pointer$#1.base| .cse29 (store .cse30 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse28 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse28 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse27 (select (select .cse27 .cse5) v_arrayElimCell_107))) v_arrayElimCell_94) .cse5))) (not (= (select .cse30 v_arrayElimIndex_17) .cse4)))))))) .cse35) (or .cse2 (forall ((v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (let ((.cse38 (select .cse9 v_arrayElimCell_112))) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| .cse38))) (or (= v_arrayElimCell_111 v_arrayElimIndex_17) (= v_arrayElimCell_112 v_arrayElimIndex_17) (not (= .cse5 (select (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$#1.base| .cse38 (store .cse39 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse37 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse37 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse36 (select (select .cse36 .cse5) v_arrayElimCell_111))) v_arrayElimCell_92))) (not (= (select .cse39 v_arrayElimIndex_17) .cse4)))))) .cse10) (or .cse40 .cse16) (or .cse2 (and (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_101 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32))) (let ((.cse42 (select .cse9 v_arrayElimCell_102))) (let ((.cse41 (select |c_#memory_$Pointer$#1.base| .cse42))) (or (not (= (select .cse41 v_arrayElimIndex_17) .cse4)) (= .cse42 .cse4) (not (= .cse5 (select (let ((.cse43 (let ((.cse44 (store |c_#memory_$Pointer$#1.base| .cse42 (store .cse41 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse44 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse44 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse43 (select (select .cse43 .cse5) v_arrayElimCell_101))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))))) .cse10) (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_103 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse47 (select .cse9 v_arrayElimCell_104))) (let ((.cse48 (select |c_#memory_$Pointer$#1.base| .cse47))) (or (not (= .cse5 (select (let ((.cse45 (let ((.cse46 (store |c_#memory_$Pointer$#1.base| .cse47 (store .cse48 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse46 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse46 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse45 (select (select .cse45 .cse5) v_arrayElimCell_103))) v_arrayElimCell_94))) (not (= (select .cse48 v_arrayElimIndex_17) .cse4)) (= v_arrayElimCell_104 v_arrayElimIndex_17))))) .cse35) (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_99 (_ BitVec 32)) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse51 (select .cse9 v_arrayElimCell_100))) (let ((.cse52 (select |c_#memory_$Pointer$#1.base| .cse51))) (or (= v_arrayElimCell_100 v_arrayElimIndex_17) (not (= .cse5 (select (let ((.cse49 (let ((.cse50 (store |c_#memory_$Pointer$#1.base| .cse51 (store .cse52 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse50 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse50 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse49 (select (select .cse49 .cse5) v_arrayElimCell_99))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))) (not (= (select .cse52 v_arrayElimIndex_17) .cse4)))))) .cse10) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_101 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (let ((.cse53 (select .cse9 v_arrayElimCell_102))) (let ((.cse56 (select |c_#memory_$Pointer$#1.base| .cse53))) (or (= .cse53 .cse4) (not (= .cse5 (select (let ((.cse54 (let ((.cse55 (store |c_#memory_$Pointer$#1.base| .cse53 (store .cse56 v_prenex_5 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse55 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse55 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_6))))) (select .cse54 (select (select .cse54 .cse5) v_arrayElimCell_101))) v_arrayElimCell_94))) (not (= .cse4 (select .cse56 v_prenex_5))))))) .cse35))) (or .cse57 .cse16) (or .cse1 .cse16) (or .cse35 (forall ((v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse60 (select .cse9 v_arrayElimCell_118))) (let ((.cse61 (select |c_#memory_$Pointer$#1.base| .cse60))) (or (not (= .cse5 (select (let ((.cse58 (let ((.cse59 (store |c_#memory_$Pointer$#1.base| .cse60 (store .cse61 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse59 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse59 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse58 (select (select .cse58 .cse5) v_arrayElimCell_118))) v_arrayElimCell_94))) (not (= (select .cse61 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)))))) (or (forall ((v_prenex_50 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32))) (let ((.cse64 (select .cse9 v_arrayElimCell_118))) (let ((.cse65 (select |c_#memory_$Pointer$#1.base| .cse64))) (or (not (= .cse5 (select (let ((.cse62 (let ((.cse63 (store |c_#memory_$Pointer$#1.base| .cse64 (store .cse65 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse63 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse63 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_50))))) (select .cse62 (select (select .cse62 .cse5) v_arrayElimCell_118))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))) (not (= (select .cse65 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= .cse64 .cse4))))) .cse10) (or (forall ((v_arrayElimCell_94 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse68 (select .cse9 v_arrayElimCell_110))) (let ((.cse69 (select |c_#memory_$Pointer$#1.base| .cse68))) (or (not (= .cse5 (select (let ((.cse66 (let ((.cse67 (store |c_#memory_$Pointer$#1.base| .cse68 (store .cse69 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse67 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse67 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_25))))) (select .cse66 (select (select .cse66 .cse5) v_arrayElimCell_110))) v_arrayElimCell_94))) (= .cse68 .cse4) (= .cse5 .cse68) (not (= (select .cse69 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)))))) .cse35) (or .cse0 .cse15) (or (forall ((v_prenex_50 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32))) (let ((.cse72 (select .cse9 v_arrayElimCell_118))) (let ((.cse73 (select |c_#memory_$Pointer$#1.base| .cse72))) (or (not (= .cse5 (select (let ((.cse70 (let ((.cse71 (store |c_#memory_$Pointer$#1.base| .cse72 (store .cse73 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse71 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse71 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_50))))) (select .cse70 (select (select .cse70 .cse5) v_arrayElimCell_118))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))) (not (= (select .cse73 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) .cse10) (or (forall ((v_prenex_15 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse74 (select .cse9 v_arrayElimCell_110))) (let ((.cse77 (select |c_#memory_$Pointer$#1.base| .cse74))) (or (= .cse74 .cse4) (not (= .cse5 (select (let ((.cse75 (let ((.cse76 (store |c_#memory_$Pointer$#1.base| .cse74 (store .cse77 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse76 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse76 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_15))))) (select .cse75 (select (select .cse75 .cse5) v_arrayElimCell_110))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))) (= .cse5 .cse74) (not (= (select .cse77 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)))))) .cse10) (or .cse78 .cse16) (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse79 (select .cse9 v_arrayElimCell_114))) (let ((.cse80 (select |c_#memory_$Pointer$#1.base| .cse79))) (or (= v_arrayElimCell_114 v_arrayElimIndex_17) (= .cse79 .cse4) (not (= (select .cse80 v_arrayElimIndex_17) .cse4)) (not (= .cse5 (select (let ((.cse81 (let ((.cse82 (store |c_#memory_$Pointer$#1.base| .cse79 (store .cse80 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse82 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse82 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse81 (select (select .cse81 .cse5) v_arrayElimCell_114))) v_arrayElimCell_94))))))) .cse35) (or .cse2 (forall ((v_arrayElimCell_116 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse86 (select .cse9 v_arrayElimCell_116))) (let ((.cse83 (select |c_#memory_$Pointer$#1.base| .cse86))) (or (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (not (= (select .cse83 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (not (= .cse5 (select (let ((.cse84 (let ((.cse85 (store |c_#memory_$Pointer$#1.base| .cse86 (store .cse83 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse85 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse85 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_46))))) (select .cse84 (select (select .cse84 .cse5) v_arrayElimCell_116))) v_arrayElimCell_92))))))) .cse10) (or .cse57 .cse0) (or (forall ((v_arrayElimCell_116 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse89 (select .cse9 v_arrayElimCell_116))) (let ((.cse90 (select |c_#memory_$Pointer$#1.base| .cse89))) (or (not (= .cse5 (select (let ((.cse87 (let ((.cse88 (store |c_#memory_$Pointer$#1.base| .cse89 (store .cse90 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse88 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse88 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse87 (select (select .cse87 .cse5) v_arrayElimCell_116))) v_arrayElimCell_94))) (= .cse89 .cse4) (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (not (= (select .cse90 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)))))) .cse35) (or .cse2 (forall ((v_arrayElimCell_116 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse91 (select .cse9 v_arrayElimCell_116))) (let ((.cse92 (select |c_#memory_$Pointer$#1.base| .cse91))) (or (= .cse91 .cse4) (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (not (= (select .cse92 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (not (= .cse5 (select (let ((.cse93 (let ((.cse94 (store |c_#memory_$Pointer$#1.base| .cse91 (store .cse92 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse94 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse94 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_46))))) (select .cse93 (select (select .cse93 .cse5) v_arrayElimCell_116))) v_arrayElimCell_92))))))) .cse10) (or (let ((.cse95 (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_96 (_ BitVec 32)) (v_arrayElimCell_95 (_ BitVec 32))) (let ((.cse103 (select .cse9 v_arrayElimCell_96))) (let ((.cse100 (select |c_#memory_$Pointer$#1.base| .cse103))) (or (= v_arrayElimCell_96 v_arrayElimIndex_17) (not (= (select .cse100 v_arrayElimIndex_17) .cse4)) (not (= .cse5 (select (let ((.cse101 (let ((.cse102 (store |c_#memory_$Pointer$#1.base| .cse103 (store .cse100 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse102 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse102 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse101 (select (select .cse101 .cse5) v_arrayElimCell_95))) v_arrayElimIndex_17))) (= v_arrayElimCell_95 v_arrayElimIndex_17))))))) (and (or .cse95 .cse16) (or .cse0 .cse95) (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_95 (_ BitVec 32))) (let ((.cse98 (select .cse9 v_arrayElimCell_95))) (let ((.cse99 (select |c_#memory_$Pointer$#1.base| .cse98))) (or (forall ((v_ArrVal_536 (_ BitVec 32))) (not (= .cse5 (select (let ((.cse96 (let ((.cse97 (store |c_#memory_$Pointer$#1.base| .cse98 (store .cse99 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse97 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse97 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse96 (select (select .cse96 .cse5) v_arrayElimCell_95))) v_arrayElimIndex_17)))) (= v_arrayElimCell_95 v_arrayElimIndex_17) (not (= (select .cse99 v_arrayElimIndex_17) .cse4)))))))) .cse10) (or (forall ((v_arrayElimCell_116 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32))) (let ((.cse106 (select .cse9 v_arrayElimCell_116))) (let ((.cse107 (select |c_#memory_$Pointer$#1.base| .cse106))) (or (not (= .cse5 (select (let ((.cse104 (let ((.cse105 (store |c_#memory_$Pointer$#1.base| .cse106 (store .cse107 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse105 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse105 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_47))))) (select .cse104 (select (select .cse104 .cse5) v_arrayElimCell_116))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))) (= .cse106 .cse4) (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (not (= (select .cse107 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)))))) .cse10) (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse108 (select .cse9 v_arrayElimCell_110))) (let ((.cse111 (select |c_#memory_$Pointer$#1.base| .cse108))) (or (= .cse5 .cse108) (= v_arrayElimCell_110 v_arrayElimIndex_17) (not (= .cse5 (select (let ((.cse109 (let ((.cse110 (store |c_#memory_$Pointer$#1.base| .cse108 (store .cse111 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse110 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse110 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse109 (select (select .cse109 .cse5) v_arrayElimCell_110))) v_arrayElimIndex_17))) (not (= (select .cse111 v_arrayElimIndex_17) .cse4)))))) .cse10) (or .cse17 (and (or (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse112 (select .cse9 v_arrayElimCell_106))) (let ((.cse115 (select |c_#memory_$Pointer$#1.base| .cse112))) (or (= .cse112 .cse4) (= v_arrayElimCell_105 v_arrayElimCell_106) (not (= .cse5 (select (let ((.cse113 (let ((.cse114 (store |c_#memory_$Pointer$#1.base| .cse112 (store .cse115 v_prenex_11 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse114 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse114 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_12))))) (select .cse113 (select (select .cse113 .cse5) v_arrayElimCell_105))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))) (not (= (select .cse115 v_prenex_11) .cse4)))))) .cse10) (or (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (let ((.cse116 (select .cse9 v_arrayElimCell_106))) (let ((.cse119 (select |c_#memory_$Pointer$#1.base| .cse116))) (or (= .cse116 .cse4) (not (= .cse5 (select (let ((.cse117 (let ((.cse118 (store |c_#memory_$Pointer$#1.base| .cse116 (store .cse119 v_prenex_7 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse118 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse118 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_8))))) (select .cse117 (select (select .cse117 .cse5) v_arrayElimCell_105))) v_prenex_13))) (= v_arrayElimCell_105 v_arrayElimCell_106) (not (= (select .cse119 v_prenex_7) .cse4)))))) .cse35) (or (forall ((v_prenex_10 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse123 (select .cse9 v_arrayElimCell_106))) (let ((.cse120 (select |c_#memory_$Pointer$#1.base| .cse123))) (or (= v_arrayElimCell_106 v_prenex_9) (= v_arrayElimCell_105 v_arrayElimCell_106) (not (= (select .cse120 v_prenex_9) .cse4)) (not (= (select (let ((.cse121 (let ((.cse122 (store |c_#memory_$Pointer$#1.base| .cse123 (store .cse120 v_prenex_9 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse122 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse122 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_10))))) (select .cse121 (select (select .cse121 .cse5) v_arrayElimCell_105))) v_arrayElimCell_94) .cse5)))))) .cse35) (or (forall ((v_arrayElimIndex_17 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (let ((.cse127 (select .cse9 v_arrayElimCell_106))) (let ((.cse124 (select |c_#memory_$Pointer$#1.base| .cse127))) (or (not (= (select .cse124 v_arrayElimIndex_17) .cse4)) (= v_arrayElimCell_105 v_arrayElimCell_106) (= v_arrayElimCell_106 v_arrayElimIndex_17) (not (= .cse5 (select (let ((.cse125 (let ((.cse126 (store |c_#memory_$Pointer$#1.base| .cse127 (store .cse124 v_arrayElimIndex_17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse126 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse126 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse125 (select (select .cse125 .cse5) v_arrayElimCell_105))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))))) .cse10))) (or .cse35 (forall ((v_prenex_32 (_ BitVec 32)) (v_prenex_34 (_ BitVec 32)) (v_prenex_33 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse129 (select .cse9 v_arrayElimCell_110))) (let ((.cse128 (select |c_#memory_$Pointer$#1.base| .cse129))) (or (not (= (select .cse128 v_prenex_32) .cse4)) (= .cse5 .cse129) (= v_arrayElimCell_110 v_prenex_32) (not (= (select (let ((.cse130 (let ((.cse131 (store |c_#memory_$Pointer$#1.base| .cse129 (store .cse128 v_prenex_32 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse131 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse131 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_33))))) (select .cse130 (select (select .cse130 .cse5) v_arrayElimCell_110))) v_prenex_34) .cse5))))))) (or .cse0 .cse132) (or (forall ((v_prenex_27 (_ BitVec 32)) (v_prenex_26 (_ BitVec 32)) (v_prenex_28 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse135 (select .cse9 v_arrayElimCell_110))) (let ((.cse136 (select |c_#memory_$Pointer$#1.base| .cse135))) (or (not (= .cse5 (select (let ((.cse133 (let ((.cse134 (store |c_#memory_$Pointer$#1.base| .cse135 (store .cse136 v_prenex_26 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse134 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse134 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_27))))) (select .cse133 (select (select .cse133 .cse5) v_arrayElimCell_110))) v_prenex_28))) (= v_arrayElimCell_110 v_prenex_26) (not (= (select .cse136 v_prenex_26) .cse4)) (= .cse5 .cse135))))) .cse2 .cse10) (or (forall ((v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_118 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse139 (select .cse9 v_arrayElimCell_118))) (let ((.cse140 (select |c_#memory_$Pointer$#1.base| .cse139))) (or (not (= .cse5 (select (let ((.cse137 (let ((.cse138 (store |c_#memory_$Pointer$#1.base| .cse139 (store .cse140 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse138 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse138 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse137 (select (select .cse137 .cse5) v_arrayElimCell_118))) v_arrayElimCell_94))) (not (= (select .cse140 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= .cse139 .cse4))))) .cse35) (or .cse0 .cse78) (or .cse2 (forall ((v_prenex_14 (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse141 (select .cse9 v_arrayElimCell_110))) (let ((.cse142 (select |c_#memory_$Pointer$#1.base| .cse141))) (or (= .cse5 .cse141) (not (= (select .cse142 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (not (= .cse5 (select (let ((.cse143 (let ((.cse144 (store |c_#memory_$Pointer$#1.base| .cse141 (store .cse142 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse144 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse144 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_14))))) (select .cse143 (select (select .cse143 .cse5) v_arrayElimCell_110))) v_arrayElimCell_92))) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) .cse10) (or (forall ((v_prenex_36 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse147 (select .cse9 v_arrayElimCell_110))) (let ((.cse148 (select |c_#memory_$Pointer$#1.base| .cse147))) (or (not (= (select (let ((.cse145 (let ((.cse146 (store |c_#memory_$Pointer$#1.base| .cse147 (store .cse148 v_prenex_35 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse146 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse146 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_36))))) (select .cse145 (select (select .cse145 .cse5) v_arrayElimCell_110))) v_prenex_35) .cse5)) (= .cse147 .cse4) (= .cse5 .cse147) (not (= (select .cse148 v_prenex_35) .cse4)))))) .cse10) (or .cse2 (forall ((v_prenex_23 (_ BitVec 32)) (v_prenex_22 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_prenex_24 (_ BitVec 32))) (let ((.cse151 (select .cse9 v_arrayElimCell_110))) (let ((.cse152 (select |c_#memory_$Pointer$#1.base| .cse151))) (or (not (= .cse5 (select (let ((.cse149 (let ((.cse150 (store |c_#memory_$Pointer$#1.base| .cse151 (store .cse152 v_prenex_22 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse150 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse150 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_23))))) (select .cse149 (select (select .cse149 .cse5) v_arrayElimCell_110))) v_prenex_24))) (= .cse151 .cse4) (= .cse5 .cse151) (not (= .cse4 (select .cse152 v_prenex_22))))))) .cse10) (or .cse0 .cse40) (or (forall ((v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse156 (select .cse9 v_arrayElimCell_114))) (let ((.cse153 (select |c_#memory_$Pointer$#1.base| .cse156))) (or (= v_arrayElimCell_114 v_prenex_44) (not (= (select .cse153 v_prenex_44) .cse4)) (not (= .cse5 (select (let ((.cse154 (let ((.cse155 (store |c_#memory_$Pointer$#1.base| .cse156 (store .cse153 v_prenex_44 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse155 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse155 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_45))))) (select .cse154 (select (select .cse154 .cse5) v_arrayElimCell_114))) v_prenex_44))) (= .cse156 .cse4))))) .cse10) (or .cse132 .cse16) (or (forall ((v_arrayElimCell_116 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32))) (let ((.cse159 (select .cse9 v_arrayElimCell_116))) (let ((.cse160 (select |c_#memory_$Pointer$#1.base| .cse159))) (or (not (= .cse5 (select (let ((.cse157 (let ((.cse158 (store |c_#memory_$Pointer$#1.base| .cse159 (store .cse160 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse158 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse158 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_47))))) (select .cse157 (select (select .cse157 .cse5) v_arrayElimCell_116))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))) (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (not (= (select .cse160 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)))))) .cse10) (or (forall ((v_prenex_19 (_ BitVec 32)) (v_prenex_37 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse163 (select .cse9 v_arrayElimCell_110))) (let ((.cse164 (select |c_#memory_$Pointer$#1.base| .cse163))) (or (not (= .cse5 (select (let ((.cse161 (let ((.cse162 (store |c_#memory_$Pointer$#1.base| .cse163 (store .cse164 v_prenex_18 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse162 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse162 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_19))))) (select .cse161 (select (select .cse161 .cse5) v_arrayElimCell_110))) v_prenex_37))) (= .cse163 .cse4) (= .cse5 .cse163) (not (= (select .cse164 v_prenex_18) .cse4)))))) .cse35) (or (forall ((v_arrayElimCell_94 (_ BitVec 32)) (v_prenex_25 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse167 (select .cse9 v_arrayElimCell_110))) (let ((.cse168 (select |c_#memory_$Pointer$#1.base| .cse167))) (or (not (= .cse5 (select (let ((.cse165 (let ((.cse166 (store |c_#memory_$Pointer$#1.base| .cse167 (store .cse168 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse166 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse166 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_prenex_25))))) (select .cse165 (select (select .cse165 .cse5) v_arrayElimCell_110))) v_arrayElimCell_94))) (= .cse5 .cse167) (not (= (select .cse168 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)) (= v_arrayElimCell_110 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) .cse35) (or (forall ((v_arrayElimCell_116 (_ BitVec 32)) (v_ArrVal_536 (_ BitVec 32)) (v_arrayElimCell_94 (_ BitVec 32))) (let ((.cse171 (select .cse9 v_arrayElimCell_116))) (let ((.cse172 (select |c_#memory_$Pointer$#1.base| .cse171))) (or (not (= .cse5 (select (let ((.cse169 (let ((.cse170 (store |c_#memory_$Pointer$#1.base| .cse171 (store .cse172 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) (store .cse170 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse170 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_536))))) (select .cse169 (select (select .cse169 .cse5) v_arrayElimCell_116))) v_arrayElimCell_94))) (= v_arrayElimCell_116 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) (not (= (select .cse172 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|) .cse4)))))) .cse35)))))) is different from true [2024-11-27 20:16:54,916 INFO L224 Elim1Store]: Index analysis took 458 ms