./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 03:12:05,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 03:12:05,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 03:12:05,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 03:12:05,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 03:12:05,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 03:12:05,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 03:12:05,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 03:12:05,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 03:12:05,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 03:12:05,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 03:12:05,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 03:12:05,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 03:12:05,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 03:12:05,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 03:12:05,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 03:12:05,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 03:12:05,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 03:12:05,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 03:12:05,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 03:12:05,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 03:12:05,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 03:12:05,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 03:12:05,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 03:12:05,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 03:12:05,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 03:12:05,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 03:12:05,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 03:12:05,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 03:12:05,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 03:12:05,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 03:12:05,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 03:12:05,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 03:12:05,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 03:12:05,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 03:12:05,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 03:12:05,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 03:12:05,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 03:12:05,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 03:12:05,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 03:12:05,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 03:12:05,370 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 03:12:05,391 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 03:12:05,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 03:12:05,391 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 03:12:05,392 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 03:12:05,392 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 03:12:05,392 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 03:12:05,393 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 03:12:05,393 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 03:12:05,393 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 03:12:05,393 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 03:12:05,393 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 03:12:05,394 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 03:12:05,394 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 03:12:05,394 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 03:12:05,394 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 03:12:05,394 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 03:12:05,395 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 03:12:05,395 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 03:12:05,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 03:12:05,396 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 03:12:05,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 03:12:05,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 03:12:05,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 03:12:05,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 03:12:05,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 03:12:05,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 03:12:05,397 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 03:12:05,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 03:12:05,397 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 03:12:05,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 03:12:05,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 03:12:05,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 03:12:05,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:12:05,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 03:12:05,398 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 03:12:05,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 03:12:05,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 03:12:05,399 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 03:12:05,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 03:12:05,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 03:12:05,399 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 03:12:05,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Taipan 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2022-12-14 03:12:05,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 03:12:05,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 03:12:05,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 03:12:05,601 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 03:12:05,601 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 03:12:05,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-12-14 03:12:08,087 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 03:12:08,293 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 03:12:08,293 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-12-14 03:12:08,303 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/data/6587ee33e/eebf912a09c240c9851fcd087d51a975/FLAGaed43ad86 [2022-12-14 03:12:08,314 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/data/6587ee33e/eebf912a09c240c9851fcd087d51a975 [2022-12-14 03:12:08,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 03:12:08,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 03:12:08,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 03:12:08,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 03:12:08,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 03:12:08,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:12:08" (1/1) ... [2022-12-14 03:12:08,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b86ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08, skipping insertion in model container [2022-12-14 03:12:08,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:12:08" (1/1) ... [2022-12-14 03:12:08,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 03:12:08,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 03:12:08,599 WARN L237 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_7fe1212f-f326-4889-b260-ef7eb4d50edf/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2022-12-14 03:12:08,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:12:08,612 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 03:12:08,649 WARN L237 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_7fe1212f-f326-4889-b260-ef7eb4d50edf/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2022-12-14 03:12:08,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:12:08,673 INFO L208 MainTranslator]: Completed translation [2022-12-14 03:12:08,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08 WrapperNode [2022-12-14 03:12:08,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 03:12:08,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 03:12:08,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 03:12:08,675 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 03:12:08,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08" (1/1) ... [2022-12-14 03:12:08,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08" (1/1) ... [2022-12-14 03:12:08,713 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 172 [2022-12-14 03:12:08,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 03:12:08,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 03:12:08,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 03:12:08,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 03:12:08,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08" (1/1) ... [2022-12-14 03:12:08,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08" (1/1) ... [2022-12-14 03:12:08,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08" (1/1) ... [2022-12-14 03:12:08,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08" (1/1) ... [2022-12-14 03:12:08,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08" (1/1) ... [2022-12-14 03:12:08,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08" (1/1) ... [2022-12-14 03:12:08,733 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08" (1/1) ... [2022-12-14 03:12:08,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08" (1/1) ... [2022-12-14 03:12:08,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 03:12:08,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 03:12:08,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 03:12:08,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 03:12:08,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08" (1/1) ... [2022-12-14 03:12:08,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:12:08,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:12:08,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 03:12:08,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 03:12:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 03:12:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 03:12:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-14 03:12:08,795 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-14 03:12:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 03:12:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 03:12:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 03:12:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 03:12:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 03:12:08,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 03:12:08,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 03:12:08,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 03:12:08,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 03:12:08,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 03:12:08,882 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 03:12:08,883 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 03:12:09,087 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 03:12:09,156 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 03:12:09,156 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-14 03:12:09,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:12:09 BoogieIcfgContainer [2022-12-14 03:12:09,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 03:12:09,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 03:12:09,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 03:12:09,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 03:12:09,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:12:08" (1/3) ... [2022-12-14 03:12:09,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e63458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:12:09, skipping insertion in model container [2022-12-14 03:12:09,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:08" (2/3) ... [2022-12-14 03:12:09,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e63458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:12:09, skipping insertion in model container [2022-12-14 03:12:09,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:12:09" (3/3) ... [2022-12-14 03:12:09,168 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2022-12-14 03:12:09,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 03:12:09,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 03:12:09,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 03:12:09,239 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@17896fa8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 03:12:09,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 03:12:09,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 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) [2022-12-14 03:12:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 03:12:09,251 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:12:09,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:12:09,252 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:12:09,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:12:09,257 INFO L85 PathProgramCache]: Analyzing trace with hash -165851543, now seen corresponding path program 1 times [2022-12-14 03:12:09,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:12:09,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248978998] [2022-12-14 03:12:09,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:12:09,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:12:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:12:09,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 03:12:09,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:12:09,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248978998] [2022-12-14 03:12:09,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248978998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:12:09,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:12:09,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 03:12:09,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958505816] [2022-12-14 03:12:09,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:12:09,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:12:09,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:12:09,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:12:09,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:12:09,676 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-12-14 03:12:09,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:12:09,769 INFO L93 Difference]: Finished difference Result 53 states and 79 transitions. [2022-12-14 03:12:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:12:09,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16 [2022-12-14 03:12:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:12:09,776 INFO L225 Difference]: With dead ends: 53 [2022-12-14 03:12:09,776 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 03:12:09,778 INFO L412 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 [2022-12-14 03:12:09,780 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:12:09,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:12:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 03:12:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-12-14 03:12:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 03:12:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-12-14 03:12:09,807 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2022-12-14 03:12:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:12:09,808 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-12-14 03:12:09,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-12-14 03:12:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-12-14 03:12:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 03:12:09,810 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:12:09,810 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:12:09,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 03:12:09,811 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:12:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:12:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1569845982, now seen corresponding path program 1 times [2022-12-14 03:12:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:12:09,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731638332] [2022-12-14 03:12:09,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:12:09,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:12:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:12:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 03:12:10,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:12:10,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731638332] [2022-12-14 03:12:10,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731638332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:12:10,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:12:10,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 03:12:10,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797958700] [2022-12-14 03:12:10,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:12:10,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 03:12:10,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:12:10,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 03:12:10,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 03:12:10,017 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 03:12:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:12:10,136 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2022-12-14 03:12:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 03:12:10,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-12-14 03:12:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:12:10,138 INFO L225 Difference]: With dead ends: 36 [2022-12-14 03:12:10,138 INFO L226 Difference]: Without dead ends: 25 [2022-12-14 03:12:10,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:12:10,140 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:12:10,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:12:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-14 03:12:10,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-12-14 03:12:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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) [2022-12-14 03:12:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-12-14 03:12:10,146 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 22 [2022-12-14 03:12:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:12:10,147 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-12-14 03:12:10,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 03:12:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-12-14 03:12:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 03:12:10,148 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:12:10,148 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:12:10,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 03:12:10,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:12:10,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:12:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1308238578, now seen corresponding path program 1 times [2022-12-14 03:12:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:12:10,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301692697] [2022-12-14 03:12:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:12:10,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:12:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:12:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:12:13,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:12:13,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301692697] [2022-12-14 03:12:13,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301692697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:12:13,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000255610] [2022-12-14 03:12:13,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:12:13,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:12:13,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:12:13,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:12:13,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 03:12:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:12:13,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 125 conjunts are in the unsatisfiable core [2022-12-14 03:12:13,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:12:13,827 INFO L350 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 [2022-12-14 03:12:14,054 INFO L350 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 13 treesize of output 9 [2022-12-14 03:12:14,127 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 03:12:14,128 INFO L350 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 [2022-12-14 03:12:14,210 INFO L350 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 19 treesize of output 18 [2022-12-14 03:12:14,318 INFO L350 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 18 treesize of output 20 [2022-12-14 03:12:14,474 INFO L350 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 44 treesize of output 24 [2022-12-14 03:12:14,481 INFO L350 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 11 treesize of output 7 [2022-12-14 03:12:14,488 INFO L350 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 [2022-12-14 03:12:14,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 03:12:14,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:14,671 INFO L350 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 52 treesize of output 46 [2022-12-14 03:12:14,689 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-12-14 03:12:14,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 03:12:14,702 INFO L350 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 18 treesize of output 20 [2022-12-14 03:12:14,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:14,718 INFO L350 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 14 treesize of output 16 [2022-12-14 03:12:15,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:15,105 INFO L350 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 106 treesize of output 66 [2022-12-14 03:12:15,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:15,114 INFO L350 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 22 treesize of output 24 [2022-12-14 03:12:15,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:15,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:15,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 03:12:15,131 INFO L350 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 18 treesize of output 16 [2022-12-14 03:12:15,137 INFO L350 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 14 treesize of output 16 [2022-12-14 03:12:15,205 INFO L350 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 15 treesize of output 7 [2022-12-14 03:12:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:12:15,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:12:16,258 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse1 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| 0))) (and (forall ((v_ArrVal_474 Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| Int) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| v_ArrVal_474)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_450) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_463) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_464) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_455) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or (not .cse1) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse2 (= .cse5 0)) (.cse3 (= .cse4 0))) (and (or (not .cse2) (not .cse3) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_469 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_476 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_458) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_451) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_473) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or (and .cse2 .cse3) (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_460) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_468) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_451) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| .cse4)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_470) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| .cse5)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_453) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_461) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_473) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (not (<= 0 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))) (or (forall ((v_ArrVal_474 Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| Int) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| v_ArrVal_474)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_450) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_463) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_464) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_455) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse1))) is different from false [2022-12-14 03:12:16,346 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse4 (= .cse1 0)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select |c_#memory_int| .cse1))) (and (forall ((v_ArrVal_474 Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| Int) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (or (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| 0) (not (<= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse1 (store .cse2 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| v_ArrVal_474)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_450) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_463) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_464) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_455) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (or (not (<= 0 .cse0)) (let ((.cse3 (= .cse0 0))) (and (or .cse3 (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_460) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_468) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_451) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| .cse1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_475) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_470) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_453) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_461) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_473) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (or (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_469 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_476 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_458) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_451) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_476) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_469) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_473) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not .cse3)))) (not .cse4)) (or .cse4 (forall ((v_ArrVal_474 Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| Int) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse1 (store .cse2 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| v_ArrVal_474)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_450) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_463) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_464) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_455) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))) is different from false [2022-12-14 03:12:17,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000255610] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:12:17,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [574056401] [2022-12-14 03:12:17,219 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 03:12:17,220 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 03:12:17,222 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 03:12:17,225 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 03:12:17,226 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 03:12:17,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:17,266 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 03:12:17,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 03:12:17,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:17,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 22 [2022-12-14 03:12:17,298 INFO L350 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 12 treesize of output 9 [2022-12-14 03:12:17,301 INFO L350 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 5 [2022-12-14 03:12:17,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:17,313 INFO L350 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 16 treesize of output 17 [2022-12-14 03:12:17,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:17,319 INFO L350 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 22 treesize of output 7 [2022-12-14 03:12:17,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:17,324 INFO L350 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 22 treesize of output 7 [2022-12-14 03:12:17,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:17,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-12-14 03:12:17,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:17,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-12-14 03:12:17,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:17,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-12-14 03:12:17,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:17,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-12-14 03:12:17,447 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:17,454 INFO L350 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 [2022-12-14 03:12:17,461 INFO L350 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 [2022-12-14 03:12:17,469 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:17,479 INFO L350 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 [2022-12-14 03:12:17,507 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:17,514 INFO L350 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 [2022-12-14 03:12:17,524 INFO L350 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 [2022-12-14 03:12:17,531 INFO L350 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 [2022-12-14 03:12:17,539 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:17,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:17,565 INFO L350 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 [2022-12-14 03:12:17,574 INFO L350 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 19 treesize of output 11 [2022-12-14 03:12:17,583 INFO L350 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 [2022-12-14 03:12:17,776 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:17,778 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:17,780 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:17,781 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:17,783 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:17,793 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:17,800 INFO L350 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 [2022-12-14 03:12:17,809 INFO L350 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 [2022-12-14 03:12:17,818 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:17,825 INFO L350 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 [2022-12-14 03:12:17,989 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:17,991 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:17,992 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:17,993 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:17,994 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:18,003 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:18,011 INFO L350 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 [2022-12-14 03:12:18,020 INFO L350 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 [2022-12-14 03:12:18,028 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:18,037 INFO L350 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 [2022-12-14 03:12:18,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:18,068 INFO L350 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 [2022-12-14 03:12:18,075 INFO L350 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 19 treesize of output 11 [2022-12-14 03:12:18,086 INFO L350 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 [2022-12-14 03:12:18,304 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:18,305 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:18,307 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:18,308 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:18,309 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:18,318 INFO L350 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 [2022-12-14 03:12:18,325 INFO L350 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 [2022-12-14 03:12:18,335 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:18,344 INFO L350 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 [2022-12-14 03:12:18,352 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:18,495 INFO L350 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 [2022-12-14 03:12:18,504 INFO L350 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 [2022-12-14 03:12:18,511 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:18,519 INFO L350 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 [2022-12-14 03:12:18,527 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:18,538 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:18,539 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:18,540 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:18,542 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:18,543 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:18,605 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 03:12:18,606 INFO L350 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 19 treesize of output 18 [2022-12-14 03:12:18,620 INFO L350 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 23 treesize of output 11 [2022-12-14 03:12:18,645 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 03:12:18,645 INFO L350 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 19 treesize of output 18 [2022-12-14 03:12:18,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:18,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:18,723 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 03:12:18,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 03:12:18,736 INFO L350 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 [2022-12-14 03:12:18,746 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:18,759 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:18,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:18,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:18,782 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 03:12:18,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 03:12:18,833 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:18,844 INFO L350 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 [2022-12-14 03:12:18,856 INFO L350 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 5 treesize of output 3 [2022-12-14 03:12:18,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:18,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:18,876 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 03:12:18,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 03:12:18,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:18,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:18,900 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 03:12:18,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 03:12:19,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 03:12:19,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 03:12:19,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 03:12:21,766 INFO L321 Elim1Store]: treesize reduction 408, result has 18.9 percent of original size [2022-12-14 03:12:21,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 843 treesize of output 899 [2022-12-14 03:12:21,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 03:12:21,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 03:12:21,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 03:12:22,275 INFO L321 Elim1Store]: treesize reduction 301, result has 12.5 percent of original size [2022-12-14 03:12:22,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 741 treesize of output 761 [2022-12-14 03:12:22,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:22,394 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-12-14 03:12:22,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 623 treesize of output 675 [2022-12-14 03:12:22,876 INFO L350 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 7 [2022-12-14 03:12:22,926 INFO L350 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 7 [2022-12-14 03:12:22,958 INFO L350 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 7 [2022-12-14 03:12:23,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,073 INFO L321 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2022-12-14 03:12:23,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 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 254 treesize of output 288 [2022-12-14 03:12:23,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,167 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-14 03:12:23,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 57 treesize of output 50 [2022-12-14 03:12:23,194 INFO L350 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 9 treesize of output 7 [2022-12-14 03:12:23,239 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:23,288 INFO L350 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 7 [2022-12-14 03:12:23,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 03:12:23,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 03:12:23,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2022-12-14 03:12:23,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 03:12:23,530 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-12-14 03:12:23,554 INFO L350 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 [2022-12-14 03:12:23,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,813 INFO L321 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2022-12-14 03:12:23,814 INFO L350 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 76 treesize of output 68 [2022-12-14 03:12:23,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,839 INFO L350 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 20 treesize of output 13 [2022-12-14 03:12:23,858 INFO L350 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 15 treesize of output 11 [2022-12-14 03:12:23,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 03:12:23,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:23,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 03:12:24,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:24,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2022-12-14 03:12:24,034 INFO L350 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 [2022-12-14 03:12:24,056 INFO L350 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 12 treesize of output 1 [2022-12-14 03:12:24,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:24,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:24,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:24,154 INFO L321 Elim1Store]: treesize reduction 93, result has 13.1 percent of original size [2022-12-14 03:12:24,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 190 [2022-12-14 03:12:24,179 INFO L350 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 30 treesize of output 24 [2022-12-14 03:12:24,206 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 03:12:24,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 03:12:24,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:12:24,463 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) 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:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) 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:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) 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:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) 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:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 03:12:24,471 INFO L158 Benchmark]: Toolchain (without parser) took 16153.59ms. Allocated memory was 136.3MB in the beginning and 266.3MB in the end (delta: 130.0MB). Free memory was 104.9MB in the beginning and 157.6MB in the end (delta: -52.7MB). Peak memory consumption was 161.0MB. Max. memory is 16.1GB. [2022-12-14 03:12:24,472 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 136.3MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 03:12:24,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.98ms. Allocated memory is still 136.3MB. Free memory was 104.9MB in the beginning and 87.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 03:12:24,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.86ms. Allocated memory is still 136.3MB. Free memory was 87.2MB in the beginning and 84.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 03:12:24,475 INFO L158 Benchmark]: Boogie Preprocessor took 22.20ms. Allocated memory is still 136.3MB. Free memory was 84.6MB in the beginning and 82.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 03:12:24,476 INFO L158 Benchmark]: RCFGBuilder took 422.98ms. Allocated memory is still 136.3MB. Free memory was 82.5MB in the beginning and 56.9MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-14 03:12:24,477 INFO L158 Benchmark]: TraceAbstraction took 15308.02ms. Allocated memory was 136.3MB in the beginning and 266.3MB in the end (delta: 130.0MB). Free memory was 56.4MB in the beginning and 157.6MB in the end (delta: -101.2MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. [2022-12-14 03:12:24,483 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 136.3MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.98ms. Allocated memory is still 136.3MB. Free memory was 104.9MB in the beginning and 87.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.86ms. Allocated memory is still 136.3MB. Free memory was 87.2MB in the beginning and 84.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.20ms. Allocated memory is still 136.3MB. Free memory was 84.6MB in the beginning and 82.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 422.98ms. Allocated memory is still 136.3MB. Free memory was 82.5MB in the beginning and 56.9MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15308.02ms. Allocated memory was 136.3MB in the beginning and 266.3MB in the end (delta: 130.0MB). Free memory was 56.4MB in the beginning and 157.6MB in the end (delta: -101.2MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-14 03:12:24,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 03:12:26,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 03:12:26,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 03:12:26,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 03:12:26,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 03:12:26,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 03:12:26,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 03:12:26,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 03:12:26,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 03:12:26,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 03:12:26,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 03:12:26,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 03:12:26,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 03:12:26,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 03:12:26,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 03:12:26,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 03:12:26,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 03:12:26,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 03:12:26,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 03:12:26,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 03:12:26,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 03:12:26,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 03:12:26,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 03:12:26,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 03:12:26,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 03:12:26,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 03:12:26,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 03:12:26,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 03:12:26,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 03:12:26,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 03:12:26,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 03:12:26,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 03:12:26,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 03:12:26,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 03:12:26,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 03:12:26,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 03:12:26,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 03:12:26,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 03:12:26,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 03:12:26,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 03:12:26,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 03:12:26,310 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-12-14 03:12:26,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 03:12:26,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 03:12:26,333 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 03:12:26,333 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 03:12:26,334 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 03:12:26,334 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 03:12:26,334 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 03:12:26,335 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 03:12:26,335 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 03:12:26,335 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 03:12:26,335 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 03:12:26,335 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 03:12:26,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 03:12:26,336 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 03:12:26,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 03:12:26,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 03:12:26,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 03:12:26,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 03:12:26,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 03:12:26,337 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 03:12:26,337 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 03:12:26,338 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 03:12:26,338 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 03:12:26,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 03:12:26,338 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 03:12:26,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 03:12:26,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 03:12:26,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 03:12:26,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 03:12:26,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:12:26,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 03:12:26,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 03:12:26,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 03:12:26,346 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 03:12:26,346 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 03:12:26,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 03:12:26,346 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 03:12:26,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 03:12:26,347 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Taipan 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2022-12-14 03:12:26,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 03:12:26,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 03:12:26,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 03:12:26,593 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 03:12:26,593 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 03:12:26,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-12-14 03:12:29,348 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 03:12:29,530 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 03:12:29,530 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-12-14 03:12:29,545 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/data/04d2cf700/0d6fedb9e3d64f3a9a75534d41325d0d/FLAG966546ce4 [2022-12-14 03:12:29,559 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/data/04d2cf700/0d6fedb9e3d64f3a9a75534d41325d0d [2022-12-14 03:12:29,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 03:12:29,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 03:12:29,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 03:12:29,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 03:12:29,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 03:12:29,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:12:29" (1/1) ... [2022-12-14 03:12:29,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc8558a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29, skipping insertion in model container [2022-12-14 03:12:29,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:12:29" (1/1) ... [2022-12-14 03:12:29,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 03:12:29,605 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 03:12:29,853 WARN L237 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_7fe1212f-f326-4889-b260-ef7eb4d50edf/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2022-12-14 03:12:29,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:12:29,869 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 03:12:29,908 WARN L237 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_7fe1212f-f326-4889-b260-ef7eb4d50edf/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2022-12-14 03:12:29,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:12:29,931 INFO L208 MainTranslator]: Completed translation [2022-12-14 03:12:29,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29 WrapperNode [2022-12-14 03:12:29,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 03:12:29,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 03:12:29,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 03:12:29,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 03:12:29,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29" (1/1) ... [2022-12-14 03:12:29,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29" (1/1) ... [2022-12-14 03:12:29,975 INFO L138 Inliner]: procedures = 130, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 173 [2022-12-14 03:12:29,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 03:12:29,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 03:12:29,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 03:12:29,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 03:12:29,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29" (1/1) ... [2022-12-14 03:12:29,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29" (1/1) ... [2022-12-14 03:12:29,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29" (1/1) ... [2022-12-14 03:12:29,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29" (1/1) ... [2022-12-14 03:12:30,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29" (1/1) ... [2022-12-14 03:12:30,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29" (1/1) ... [2022-12-14 03:12:30,014 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29" (1/1) ... [2022-12-14 03:12:30,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29" (1/1) ... [2022-12-14 03:12:30,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 03:12:30,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 03:12:30,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 03:12:30,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 03:12:30,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29" (1/1) ... [2022-12-14 03:12:30,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:12:30,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:12:30,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 03:12:30,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 03:12:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 03:12:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-14 03:12:30,084 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-14 03:12:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 03:12:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 03:12:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 03:12:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 03:12:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 03:12:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 03:12:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 03:12:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 03:12:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 03:12:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 03:12:30,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 03:12:30,200 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 03:12:30,201 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 03:12:30,579 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 03:12:30,584 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 03:12:30,584 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-14 03:12:30,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:12:30 BoogieIcfgContainer [2022-12-14 03:12:30,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 03:12:30,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 03:12:30,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 03:12:30,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 03:12:30,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:12:29" (1/3) ... [2022-12-14 03:12:30,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5b9555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:12:30, skipping insertion in model container [2022-12-14 03:12:30,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:12:29" (2/3) ... [2022-12-14 03:12:30,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5b9555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:12:30, skipping insertion in model container [2022-12-14 03:12:30,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:12:30" (3/3) ... [2022-12-14 03:12:30,599 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2022-12-14 03:12:30,617 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 03:12:30,617 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 03:12:30,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 03:12:30,660 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@539fecb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 03:12:30,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 03:12:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 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) [2022-12-14 03:12:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 03:12:30,669 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:12:30,670 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:12:30,671 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:12:30,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:12:30,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1111347289, now seen corresponding path program 1 times [2022-12-14 03:12:30,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 03:12:30,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879964687] [2022-12-14 03:12:30,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:12:30,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 03:12:30,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 03:12:30,686 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 03:12:30,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 03:12:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:12:30,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 03:12:30,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:12:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 03:12:30,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 03:12:30,865 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 03:12:30,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879964687] [2022-12-14 03:12:30,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879964687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:12:30,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:12:30,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 03:12:30,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164904074] [2022-12-14 03:12:30,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:12:30,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 03:12:30,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 03:12:30,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 03:12:30,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 03:12:30,902 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 03:12:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:12:30,931 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2022-12-14 03:12:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 03:12:30,934 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-12-14 03:12:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:12:30,944 INFO L225 Difference]: With dead ends: 77 [2022-12-14 03:12:30,944 INFO L226 Difference]: Without dead ends: 34 [2022-12-14 03:12:30,947 INFO L412 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 [2022-12-14 03:12:30,950 INFO L413 NwaCegarLoop]: 55 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, 55 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 [2022-12-14 03:12:30,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 03:12:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-14 03:12:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-12-14 03:12:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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) [2022-12-14 03:12:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-12-14 03:12:30,984 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 25 [2022-12-14 03:12:30,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:12:30,985 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-12-14 03:12:30,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 03:12:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-12-14 03:12:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 03:12:30,987 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:12:30,987 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:12:30,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 03:12:31,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 03:12:31,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:12:31,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:12:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash -234931549, now seen corresponding path program 1 times [2022-12-14 03:12:31,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 03:12:31,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414481707] [2022-12-14 03:12:31,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:12:31,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 03:12:31,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 03:12:31,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 03:12:31,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 03:12:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:12:31,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 03:12:31,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:12:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:12:31,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 03:12:31,472 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 03:12:31,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414481707] [2022-12-14 03:12:31,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414481707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:12:31,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:12:31,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 03:12:31,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255533311] [2022-12-14 03:12:31,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:12:31,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:12:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 03:12:31,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:12:31,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:12:31,476 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2022-12-14 03:12:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:12:31,496 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-12-14 03:12:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:12:31,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 [2022-12-14 03:12:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:12:31,497 INFO L225 Difference]: With dead ends: 64 [2022-12-14 03:12:31,497 INFO L226 Difference]: Without dead ends: 37 [2022-12-14 03:12:31,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:12:31,499 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 03:12:31,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 03:12:31,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-14 03:12:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-12-14 03:12:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 03:12:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-12-14 03:12:31,505 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 25 [2022-12-14 03:12:31,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:12:31,505 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-12-14 03:12:31,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2022-12-14 03:12:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-12-14 03:12:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 03:12:31,506 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:12:31,506 INFO L195 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] [2022-12-14 03:12:31,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 03:12:31,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 03:12:31,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:12:31,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:12:31,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1702704619, now seen corresponding path program 1 times [2022-12-14 03:12:31,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 03:12:31,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178727632] [2022-12-14 03:12:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:12:31,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 03:12:31,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 03:12:31,716 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 03:12:31,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 03:12:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:12:31,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 03:12:31,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:12:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 03:12:32,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 03:12:32,029 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 03:12:32,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178727632] [2022-12-14 03:12:32,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178727632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:12:32,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:12:32,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 03:12:32,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953481733] [2022-12-14 03:12:32,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:12:32,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 03:12:32,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 03:12:32,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 03:12:32,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 03:12:32,031 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 03:12:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:12:32,078 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-12-14 03:12:32,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 03:12:32,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-12-14 03:12:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:12:32,079 INFO L225 Difference]: With dead ends: 53 [2022-12-14 03:12:32,079 INFO L226 Difference]: Without dead ends: 36 [2022-12-14 03:12:32,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:12:32,080 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 28 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 03:12:32,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 87 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 03:12:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-12-14 03:12:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-12-14 03:12:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 03:12:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-12-14 03:12:32,084 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 33 [2022-12-14 03:12:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:12:32,085 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-12-14 03:12:32,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 03:12:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-12-14 03:12:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 03:12:32,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:12:32,085 INFO L195 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] [2022-12-14 03:12:32,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-14 03:12:32,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 03:12:32,287 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:12:32,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:12:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1515040147, now seen corresponding path program 1 times [2022-12-14 03:12:32,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 03:12:32,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745189169] [2022-12-14 03:12:32,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:12:32,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 03:12:32,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 03:12:32,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 03:12:32,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-14 03:12:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:12:32,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-14 03:12:32,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:12:32,775 INFO L350 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 [2022-12-14 03:12:33,058 INFO L350 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 [2022-12-14 03:12:33,172 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 03:12:33,172 INFO L350 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 [2022-12-14 03:12:33,280 INFO L350 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 18 [2022-12-14 03:12:33,316 INFO L350 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 [2022-12-14 03:12:33,455 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 03:12:33,455 INFO L350 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 40 treesize of output 39 [2022-12-14 03:12:33,471 INFO L350 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 20 [2022-12-14 03:12:33,707 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 03:12:33,708 INFO L350 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 62 treesize of output 33 [2022-12-14 03:12:33,722 INFO L350 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 11 [2022-12-14 03:12:33,731 INFO L350 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 [2022-12-14 03:12:33,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 03:12:34,038 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-14 03:12:34,038 INFO L350 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 68 [2022-12-14 03:12:34,072 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 03:12:34,072 INFO L350 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 47 treesize of output 49 [2022-12-14 03:12:34,103 INFO L321 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2022-12-14 03:12:34,104 INFO L350 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 30 treesize of output 32 [2022-12-14 03:12:34,115 INFO L350 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 18 [2022-12-14 03:12:34,150 INFO L350 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 32 treesize of output 26 [2022-12-14 03:12:34,171 INFO L350 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 81 treesize of output 65 [2022-12-14 03:12:34,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:35,043 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-14 03:12:35,044 INFO L350 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 4 case distinctions, treesize of input 108 treesize of output 95 [2022-12-14 03:12:35,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-12-14 03:12:35,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:35,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2022-12-14 03:12:35,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 03:12:35,105 INFO L350 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 25 treesize of output 13 [2022-12-14 03:12:35,239 INFO L350 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 [2022-12-14 03:12:35,248 INFO L350 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 15 treesize of output 7 [2022-12-14 03:12:35,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 03:12:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:12:35,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:12:37,645 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 03:12:37,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745189169] [2022-12-14 03:12:37,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745189169] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:12:37,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1251152537] [2022-12-14 03:12:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:12:37,645 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 03:12:37,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 03:12:37,646 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 03:12:37,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-12-14 03:12:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:12:37,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-14 03:12:37,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:12:37,988 INFO L350 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 [2022-12-14 03:12:38,274 INFO L350 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 [2022-12-14 03:12:38,455 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 03:12:38,455 INFO L350 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 [2022-12-14 03:12:38,618 INFO L350 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 18 [2022-12-14 03:12:38,810 INFO L350 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 14 treesize of output 16 [2022-12-14 03:12:39,247 INFO L350 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 22 [2022-12-14 03:12:39,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 03:12:39,259 INFO L350 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 11 [2022-12-14 03:12:39,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 03:12:39,580 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 03:12:39,581 INFO L350 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 14 treesize of output 20 [2022-12-14 03:12:39,590 INFO L350 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 [2022-12-14 03:12:39,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:39,613 INFO L350 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 44 treesize of output 40 [2022-12-14 03:12:39,643 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-14 03:12:39,643 INFO L350 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 [2022-12-14 03:12:39,677 INFO L350 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 20 [2022-12-14 03:12:40,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:40,444 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-12-14 03:12:40,444 INFO L350 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 79 treesize of output 74 [2022-12-14 03:12:40,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-12-14 03:12:40,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:40,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:40,471 INFO L350 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 21 treesize of output 25 [2022-12-14 03:12:40,485 INFO L350 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 20 [2022-12-14 03:12:40,784 INFO L350 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 34 treesize of output 18 [2022-12-14 03:12:40,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 03:12:40,949 INFO L350 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 15 treesize of output 7 [2022-12-14 03:12:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:12:40,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:12:45,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1251152537] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:12:45,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149819535] [2022-12-14 03:12:45,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:12:45,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:12:45,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:12:45,579 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:12:45,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 03:12:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:12:45,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-14 03:12:45,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:12:45,713 INFO L350 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 [2022-12-14 03:12:46,211 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 03:12:46,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 03:12:46,649 INFO L350 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 [2022-12-14 03:12:46,868 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-12-14 03:12:46,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 43 [2022-12-14 03:12:47,057 INFO L350 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 19 treesize of output 18 [2022-12-14 03:12:47,253 INFO L350 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 14 treesize of output 16 [2022-12-14 03:12:48,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:48,674 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 03:12:48,674 INFO L350 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 22 treesize of output 25 [2022-12-14 03:12:48,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:48,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:48,692 INFO L350 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 40 [2022-12-14 03:12:48,717 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-14 03:12:48,717 INFO L350 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 [2022-12-14 03:12:48,735 INFO L350 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 18 treesize of output 20 [2022-12-14 03:12:49,564 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-12-14 03:12:49,564 INFO L350 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 95 treesize of output 86 [2022-12-14 03:12:49,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-12-14 03:12:49,584 INFO L350 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 28 treesize of output 30 [2022-12-14 03:12:49,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 03:12:49,779 INFO L350 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 [2022-12-14 03:12:49,784 INFO L350 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 15 treesize of output 7 [2022-12-14 03:12:49,936 INFO L350 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 15 treesize of output 7 [2022-12-14 03:12:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:12:49,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:13:00,559 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14|))) (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_437 (_ BitVec 32)) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (_ BitVec 32)) (v_ArrVal_454 (_ BitVec 32)) (v_ArrVal_436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_454)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_455)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_456))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_437))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_442) (select (select (store (store .cse3 .cse1 v_ArrVal_441) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store .cse4 .cse1 v_ArrVal_439) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_436) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) |c_ULTIMATE.start_main_~data~0#1|) (= .cse2 (_ bv0 32)))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14|))) (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_437 (_ BitVec 32)) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (_ BitVec 32)) (v_ArrVal_454 (_ BitVec 32)) (v_ArrVal_436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_455)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_454)))) (select (select (store (let ((.cse5 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_456))) (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_437))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_442) (select (select (store (store .cse8 .cse6 v_ArrVal_441) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store .cse7 .cse6 v_ArrVal_439) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_436) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|) (= .cse6 (_ bv0 32))))))))) is different from false [2022-12-14 03:13:00,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149819535] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:13:00,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:13:00,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 23] total 58 [2022-12-14 03:13:00,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318306381] [2022-12-14 03:13:00,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:13:00,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-12-14 03:13:00,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 03:13:00,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-12-14 03:13:00,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4553, Unknown=163, NotChecked=138, Total=5112 [2022-12-14 03:13:00,721 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 58 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 44 states have internal predecessors, (71), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 03:13:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:13:26,661 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2022-12-14 03:13:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 03:13:26,663 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 44 states have internal predecessors, (71), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 34 [2022-12-14 03:13:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:13:26,665 INFO L225 Difference]: With dead ends: 76 [2022-12-14 03:13:26,665 INFO L226 Difference]: Without dead ends: 74 [2022-12-14 03:13:26,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2661 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=840, Invalid=8703, Unknown=163, NotChecked=194, Total=9900 [2022-12-14 03:13:26,670 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 461 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 79 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-12-14 03:13:26,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 498 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1558 Invalid, 26 Unknown, 0 Unchecked, 12.2s Time] [2022-12-14 03:13:26,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-14 03:13:26,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 41. [2022-12-14 03:13:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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) [2022-12-14 03:13:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-12-14 03:13:26,682 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 34 [2022-12-14 03:13:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:13:26,683 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2022-12-14 03:13:26,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 44 states have internal predecessors, (71), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 03:13:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-12-14 03:13:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 03:13:26,683 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:13:26,684 INFO L195 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] [2022-12-14 03:13:26,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-12-14 03:13:26,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-12-14 03:13:27,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-14 03:13:27,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:13:27,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:13:27,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:13:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1814087211, now seen corresponding path program 2 times [2022-12-14 03:13:27,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 03:13:27,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735045047] [2022-12-14 03:13:27,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 03:13:27,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 03:13:27,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 03:13:27,291 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 03:13:27,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-14 03:13:27,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 03:13:27,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:13:27,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 03:13:27,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:13:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 03:13:27,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:13:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 03:13:27,953 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 03:13:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735045047] [2022-12-14 03:13:27,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735045047] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:13:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [10979649] [2022-12-14 03:13:27,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 03:13:27,953 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 03:13:27,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 03:13:27,954 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 03:13:27,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-12-14 03:13:28,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 03:13:28,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:13:28,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 03:13:28,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:13:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 03:13:28,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:13:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 03:13:28,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [10979649] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:13:28,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379406364] [2022-12-14 03:13:28,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 03:13:28,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:13:28,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:13:28,511 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:13:28,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 03:13:28,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 03:13:28,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:13:28,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 03:13:28,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:13:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 03:13:28,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:13:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 03:13:29,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379406364] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:13:29,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 03:13:29,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 6, 6] total 10 [2022-12-14 03:13:29,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031585577] [2022-12-14 03:13:29,398 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 03:13:29,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 03:13:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 03:13:29,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 03:13:29,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-14 03:13:29,400 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-14 03:13:29,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:13:29,498 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-12-14 03:13:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 03:13:29,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 35 [2022-12-14 03:13:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:13:29,499 INFO L225 Difference]: With dead ends: 59 [2022-12-14 03:13:29,499 INFO L226 Difference]: Without dead ends: 41 [2022-12-14 03:13:29,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-14 03:13:29,501 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 130 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:13:29,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 148 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:13:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-12-14 03:13:29,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-12-14 03:13:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 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) [2022-12-14 03:13:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-12-14 03:13:29,513 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 35 [2022-12-14 03:13:29,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:13:29,514 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-12-14 03:13:29,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-14 03:13:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-12-14 03:13:29,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 03:13:29,514 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:13:29,514 INFO L195 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] [2022-12-14 03:13:29,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-14 03:13:29,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-12-14 03:13:29,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 03:13:30,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:13:30,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:13:30,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:13:30,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1637752339, now seen corresponding path program 1 times [2022-12-14 03:13:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 03:13:30,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177622278] [2022-12-14 03:13:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:13:30,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 03:13:30,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 03:13:30,122 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 03:13:30,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-14 03:13:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:13:30,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 03:13:30,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:13:30,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 03:13:30,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 03:13:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 03:13:30,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:13:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 03:13:30,405 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 03:13:30,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177622278] [2022-12-14 03:13:30,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177622278] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:13:30,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1130600564] [2022-12-14 03:13:30,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:13:30,405 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 03:13:30,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 03:13:30,406 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 03:13:30,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-12-14 03:13:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:13:30,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 03:13:30,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:13:30,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 03:13:30,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 03:13:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 03:13:30,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:13:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 03:13:30,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1130600564] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:13:30,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796443801] [2022-12-14 03:13:30,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:13:30,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:13:30,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:13:30,700 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:13:30,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 03:13:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:13:30,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 03:13:30,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:13:30,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 03:13:30,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 03:13:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 03:13:30,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:13:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 03:13:30,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796443801] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:13:30,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 03:13:30,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 7 [2022-12-14 03:13:30,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843717153] [2022-12-14 03:13:30,918 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 03:13:30,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 03:13:30,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 03:13:30,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 03:13:30,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 03:13:30,920 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 03:13:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:13:31,509 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-12-14 03:13:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 03:13:31,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-12-14 03:13:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:13:31,511 INFO L225 Difference]: With dead ends: 67 [2022-12-14 03:13:31,511 INFO L226 Difference]: Without dead ends: 52 [2022-12-14 03:13:31,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 03:13:31,511 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:13:31,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 181 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 03:13:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-14 03:13:31,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2022-12-14 03:13:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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) [2022-12-14 03:13:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-12-14 03:13:31,523 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 36 [2022-12-14 03:13:31,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:13:31,523 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-12-14 03:13:31,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 03:13:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-12-14 03:13:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 03:13:31,524 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:13:31,525 INFO L195 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] [2022-12-14 03:13:31,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2022-12-14 03:13:31,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-12-14 03:13:31,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 03:13:32,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:13:32,126 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:13:32,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:13:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1695010641, now seen corresponding path program 1 times [2022-12-14 03:13:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 03:13:32,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271915720] [2022-12-14 03:13:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:13:32,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 03:13:32,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 03:13:32,133 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 03:13:32,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-14 03:13:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:13:32,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 03:13:32,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:13:32,546 INFO L350 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 6 treesize of output 5 [2022-12-14 03:13:32,600 INFO L350 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 8 treesize of output 4 [2022-12-14 03:13:32,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:13:32,722 INFO L350 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 15 treesize of output 17 [2022-12-14 03:13:32,770 INFO L350 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 [2022-12-14 03:13:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:13:32,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:13:32,914 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 03:13:32,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271915720] [2022-12-14 03:13:32,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271915720] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:13:32,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [235147045] [2022-12-14 03:13:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:13:32,915 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 03:13:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 03:13:32,916 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 03:13:32,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-12-14 03:13:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:13:33,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 03:13:33,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:13:33,444 INFO L350 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 8 treesize of output 4 [2022-12-14 03:13:33,559 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 03:13:33,559 INFO L350 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 15 treesize of output 21 [2022-12-14 03:13:33,679 INFO L350 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 [2022-12-14 03:13:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:13:33,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:13:33,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [235147045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:13:33,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158661994] [2022-12-14 03:13:33,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:13:33,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:13:33,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:13:33,799 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:13:33,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 03:13:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:13:33,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 03:13:33,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:13:34,018 INFO L350 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 8 treesize of output 4 [2022-12-14 03:13:34,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:13:34,099 INFO L350 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 15 treesize of output 17 [2022-12-14 03:13:34,114 INFO L350 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 [2022-12-14 03:13:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:13:34,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:13:34,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158661994] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:13:34,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:13:34,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 23 [2022-12-14 03:13:34,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968679699] [2022-12-14 03:13:34,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:13:34,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 03:13:34,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 03:13:34,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 03:13:34,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=513, Unknown=1, NotChecked=0, Total=600 [2022-12-14 03:13:34,220 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 18 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-14 03:13:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:13:35,690 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-12-14 03:13:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 03:13:35,690 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 18 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2022-12-14 03:13:35,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:13:35,691 INFO L225 Difference]: With dead ends: 54 [2022-12-14 03:13:35,691 INFO L226 Difference]: Without dead ends: 38 [2022-12-14 03:13:35,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=194, Invalid=926, Unknown=2, NotChecked=0, Total=1122 [2022-12-14 03:13:35,693 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 75 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 5 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 03:13:35,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 252 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 296 Invalid, 6 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 03:13:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-14 03:13:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-12-14 03:13:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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) [2022-12-14 03:13:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-12-14 03:13:35,706 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 36 [2022-12-14 03:13:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:13:35,706 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-12-14 03:13:35,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 18 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-14 03:13:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-12-14 03:13:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 03:13:35,707 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:13:35,707 INFO L195 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] [2022-12-14 03:13:35,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-14 03:13:35,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-12-14 03:13:36,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 03:13:36,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:13:36,309 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:13:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:13:36,310 INFO L85 PathProgramCache]: Analyzing trace with hash 108256579, now seen corresponding path program 1 times [2022-12-14 03:13:36,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 03:13:36,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211967822] [2022-12-14 03:13:36,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:13:36,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 03:13:36,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 03:13:36,314 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 03:13:36,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-12-14 03:13:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:13:36,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 03:13:36,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:13:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 03:13:36,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 03:13:36,489 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 03:13:36,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211967822] [2022-12-14 03:13:36,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211967822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:13:36,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:13:36,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 03:13:36,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339267218] [2022-12-14 03:13:36,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:13:36,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 03:13:36,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 03:13:36,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 03:13:36,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 03:13:36,490 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 03:13:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:13:36,559 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-12-14 03:13:36,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 03:13:36,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-12-14 03:13:36,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:13:36,560 INFO L225 Difference]: With dead ends: 49 [2022-12-14 03:13:36,560 INFO L226 Difference]: Without dead ends: 36 [2022-12-14 03:13:36,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-14 03:13:36,561 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 03:13:36,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 80 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 03:13:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-12-14 03:13:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-12-14 03:13:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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) [2022-12-14 03:13:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-12-14 03:13:36,569 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 38 [2022-12-14 03:13:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:13:36,569 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-12-14 03:13:36,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 03:13:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-12-14 03:13:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 03:13:36,570 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:13:36,570 INFO L195 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, 1] [2022-12-14 03:13:36,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-12-14 03:13:36,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 03:13:36,771 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:13:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:13:36,772 INFO L85 PathProgramCache]: Analyzing trace with hash 108212869, now seen corresponding path program 1 times [2022-12-14 03:13:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 03:13:36,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911377883] [2022-12-14 03:13:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:13:36,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 03:13:36,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 03:13:36,776 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 03:13:36,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-12-14 03:13:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:13:37,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-14 03:13:37,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:13:37,132 INFO L350 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 [2022-12-14 03:13:37,332 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 03:13:37,332 INFO L350 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 [2022-12-14 03:13:37,411 INFO L350 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 [2022-12-14 03:13:37,495 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 03:13:37,496 INFO L350 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 30 treesize of output 31 [2022-12-14 03:13:37,658 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 03:13:37,658 INFO L350 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 51 treesize of output 26 [2022-12-14 03:13:37,665 INFO L350 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 11 [2022-12-14 03:13:37,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 03:13:37,785 INFO L350 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 [2022-12-14 03:13:37,931 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-14 03:13:37,932 INFO L350 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 59 [2022-12-14 03:13:37,952 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 03:13:37,952 INFO L350 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 47 treesize of output 49 [2022-12-14 03:13:37,975 INFO L321 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2022-12-14 03:13:37,975 INFO L350 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 30 treesize of output 32 [2022-12-14 03:13:37,993 INFO L350 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 32 treesize of output 26 [2022-12-14 03:13:38,048 INFO L350 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 72 treesize of output 58 [2022-12-14 03:13:38,663 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 03:13:38,663 INFO L350 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 75 [2022-12-14 03:13:38,735 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-14 03:13:38,735 INFO L350 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 125 [2022-12-14 03:13:38,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:13:38,748 INFO L350 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 62 treesize of output 35 [2022-12-14 03:13:38,768 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 03:13:38,769 INFO L350 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 1 case distinctions, treesize of input 101 treesize of output 82 [2022-12-14 03:13:38,815 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-12-14 03:13:38,816 INFO L350 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 94 [2022-12-14 03:13:38,836 INFO L350 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 42 [2022-12-14 03:13:39,105 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 03:13:39,105 INFO L350 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 100 treesize of output 47 [2022-12-14 03:13:39,113 INFO L350 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-12-14 03:13:39,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 03:13:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:13:39,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:13:39,595 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1276 (_ BitVec 32))) (= (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1281)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1274))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1279))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1276))) (select (select .cse1 .cse2) .cse3)) (bvadd (_ bv4 32) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2022-12-14 03:13:39,928 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1276 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1281)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1274))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1279))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1276))) (select (select .cse1 .cse2) .cse3)) (bvadd (_ bv4 32) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-12-14 03:13:42,485 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1276 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1281)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1274))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_1279))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1276))) (select (select .cse2 .cse3) .cse4)) (bvadd (_ bv4 32) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-12-14 03:13:43,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:13:43,927 INFO L350 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 305 treesize of output 298 [2022-12-14 03:13:44,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:13:44,086 INFO L350 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 4728 treesize of output 4468 [2022-12-14 03:13:44,170 INFO L350 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 4860 treesize of output 4210 [2022-12-14 03:13:47,358 INFO L350 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 1081 treesize of output 821 [2022-12-14 03:14:46,950 WARN L233 SmtUtils]: Spent 59.00s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-14 03:14:46,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:14:46,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1605 treesize of output 2395 [2022-12-14 03:18:37,451 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_insert_~data#1|))) (and (or .cse0 (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse1 (store (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse1 (select (select (store (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse6 (store (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse10 .cse8 (store (select .cse10 .cse8) .cse9 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))) (or (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (let ((.cse15 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse14 (select (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse11 (store (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse15 .cse13 (store (select .cse15 .cse13) .cse14 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse20 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse17 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse19 (select (select .cse20 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse16 (store (store .cse20 .cse18 (store (select .cse20 .cse18) .cse19 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse16 (select (select (store (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse22 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse24 (select (select .cse25 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse21 (store (store .cse25 .cse23 (store (select .cse25 .cse23) .cse24 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse21 (select (select (store (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (let ((.cse44 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse41 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse42 (select (select .cse41 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse43 (select (select .cse44 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse40 (store (store .cse44 .cse42 (store (select .cse44 .cse42) .cse43 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse40 (select (select (store (store .cse41 .cse42 (store (select .cse41 .cse42) .cse43 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse40 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse31 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse33 (select (select .cse34 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse27 (store (store .cse34 .cse32 (store (select .cse34 .cse32) .cse33 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse30 (store (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse28 (select (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse29 (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse26 (select (select .cse27 .cse28) .cse29)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse30 .cse28) .cse29))))))))) (= (let ((.cse39 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse36 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse38 (select (select .cse39 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse35 (store (store .cse39 .cse37 (store (select .cse39 .cse37) .cse38 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse35 (select (select (store (store .cse36 .cse37 (store (select .cse36 .cse37) .cse38 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) .cse26)))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))) .cse0) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse61 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse62 (select (select .cse61 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse63 (select (select .cse64 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse55 (store (store .cse64 .cse62 (store (select .cse64 .cse62) .cse63 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse51 (store (store .cse61 .cse62 (store (select .cse61 .cse62) .cse63 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse52 (select (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse53 (select (select .cse55 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse54 (let ((.cse60 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse57 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse58 (select (select .cse57 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse59 (select (select .cse60 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse56 (store (store .cse60 .cse58 (store (select .cse60 .cse58) .cse59 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse56 (select (select (store (store .cse57 .cse58 (store (select .cse57 .cse58) .cse59 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse56 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse50 (select (select .cse55 .cse52) .cse53))) (or (= (let ((.cse49 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse46 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse47 (select (select .cse46 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse48 (select (select .cse49 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse45 (store (store .cse49 .cse47 (store (select .cse49 .cse47) .cse48 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse45 (select (select (store (store .cse46 .cse47 (store (select .cse46 .cse47) .cse48 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse45 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) .cse50) (= .cse50 (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse51 .cse52) .cse53))) (= .cse54 (_ bv0 32)) (= .cse54 .cse50)))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (or .cse0 (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse81 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse82 (select (select .cse81 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse83 (select (select .cse84 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse75 (store (store .cse84 .cse82 (store (select .cse84 .cse82) .cse83 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse66 (store (store .cse81 .cse82 (store (select .cse81 .cse82) .cse83 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse67 (select (select .cse66 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse68 (select (select .cse75 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse69 (let ((.cse80 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse77 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse78 (select (select .cse77 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse79 (select (select .cse80 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse76 (store (store .cse80 .cse78 (store (select .cse80 .cse78) .cse79 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse76 (select (select (store (store .cse77 .cse78 (store (select .cse77 .cse78) .cse79 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse76 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse65 (select (select .cse75 .cse67) .cse68))) (or (= .cse65 (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse66 .cse67) .cse68))) (= .cse69 (let ((.cse74 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse71 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse72 (select (select .cse71 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse73 (select (select .cse74 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse70 (store (store .cse74 .cse72 (store (select .cse74 .cse72) .cse73 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse70 (select (select (store (store .cse71 .cse72 (store (select .cse71 .cse72) .cse73 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse70 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (= .cse69 .cse65) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))))))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse97 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse94 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse95 (select (select .cse94 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse96 (select (select .cse97 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse90 (store (store .cse97 .cse95 (store (select .cse97 .cse95) .cse96 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse93 (store (store .cse94 .cse95 (store (select .cse94 .cse95) .cse96 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse91 (select (select .cse93 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse92 (select (select .cse90 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (let ((.cse89 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse86 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse87 (select (select .cse86 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse88 (select (select .cse89 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse85 (store (store .cse89 .cse87 (store (select .cse89 .cse87) .cse88 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse85 (select (select (store (store .cse86 .cse87 (store (select .cse86 .cse87) .cse88 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse85 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (select (select .cse90 .cse91) .cse92)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse93 .cse91) .cse92))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))))) .cse0) (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (let ((.cse102 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse99 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse100 (select (select .cse99 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse101 (select (select .cse102 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse98 (store (store .cse102 .cse100 (store (select .cse102 .cse100) .cse101 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse98 (select (select (store (store .cse99 .cse100 (store (select .cse99 .cse100) .cse101 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse98 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse117 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse114 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse115 (select (select .cse114 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse116 (select (select .cse117 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse108 (store (store .cse117 .cse115 (store (select .cse117 .cse115) .cse116 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse104 (store (store .cse114 .cse115 (store (select .cse114 .cse115) .cse116 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse105 (select (select .cse104 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse106 (select (select .cse108 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse107 (let ((.cse113 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse110 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse111 (select (select .cse110 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse112 (select (select .cse113 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse109 (store (store .cse113 .cse111 (store (select .cse113 .cse111) .cse112 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse109 (select (select (store (store .cse110 .cse111 (store (select .cse110 .cse111) .cse112 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse109 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse103 (select (select .cse108 .cse105) .cse106))) (or (= .cse103 (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse104 .cse105) .cse106))) (= .cse107 (_ bv0 32)) (= .cse107 .cse103)))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse138 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse135 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse136 (select (select .cse135 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse137 (select (select .cse138 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse124 (store (store .cse138 .cse136 (store (select .cse138 .cse136) .cse137 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse120 (store (store .cse135 .cse136 (store (select .cse135 .cse136) .cse137 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse121 (select (select .cse120 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse122 (select (select .cse124 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse118 (let ((.cse134 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse131 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse132 (select (select .cse131 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse133 (select (select .cse134 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse130 (store (store .cse134 .cse132 (store (select .cse134 .cse132) .cse133 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse130 (select (select (store (store .cse131 .cse132 (store (select .cse131 .cse132) .cse133 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse130 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse123 (let ((.cse129 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse126 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse127 (select (select .cse126 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse128 (select (select .cse129 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse125 (store (store .cse129 .cse127 (store (select .cse129 .cse127) .cse128 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse125 (select (select (store (store .cse126 .cse127 (store (select .cse126 .cse127) .cse128 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse125 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse119 (select (select .cse124 .cse121) .cse122))) (or (= .cse118 .cse119) (= .cse119 (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse120 .cse121) .cse122))) (= .cse123 .cse118) (= .cse123 .cse119)))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse156 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse153 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse154 (select (select .cse153 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse155 (select (select .cse156 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse152 (store (store .cse156 .cse154 (store (select .cse156 .cse154) .cse155 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281)) (.cse144 (store (store .cse153 .cse154 (store (select .cse153 .cse154) .cse155 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274))) (let ((.cse145 (select (select .cse144 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse146 (select (select .cse152 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse143 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse140 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse141 (select (select .cse140 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse142 (select (select .cse143 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse139 (store (store .cse143 .cse141 (store (select .cse143 .cse141) .cse142 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse139 (select (select (store (store .cse140 .cse141 (store (select .cse140 .cse141) .cse142 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse139 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32))) (= (select (select .cse144 .cse145) .cse146) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (= (let ((.cse151 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse148 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse149 (select (select .cse148 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse150 (select (select .cse151 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse147 (store (store .cse151 .cse149 (store (select .cse151 .cse149) .cse150 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse147 (select (select (store (store .cse148 .cse149 (store (select .cse148 .cse149) .cse150 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse147 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (= (select (select .cse152 .cse145) .cse146) (_ bv0 32)) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse158 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_40))) (let ((.cse159 (select (select .cse158 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (let ((.cse161 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_39))) (let ((.cse160 (select (select .cse161 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse157 (store (store .cse158 .cse159 (store (select .cse158 .cse159) .cse160 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_38))) (select .cse157 (select (select .cse157 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse161 .cse159 (store (select .cse161 .cse159) .cse160 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_37) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= .cse159 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse182 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse179 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse180 (select (select .cse179 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse181 (select (select .cse182 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse168 (store (store .cse182 .cse180 (store (select .cse182 .cse180) .cse181 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse164 (store (store .cse179 .cse180 (store (select .cse179 .cse180) .cse181 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse165 (select (select .cse164 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse166 (select (select .cse168 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse162 (let ((.cse178 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse175 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse176 (select (select .cse175 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse177 (select (select .cse178 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse174 (store (store .cse178 .cse176 (store (select .cse178 .cse176) .cse177 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse174 (select (select (store (store .cse175 .cse176 (store (select .cse175 .cse176) .cse177 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse174 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse167 (let ((.cse173 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse170 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse171 (select (select .cse170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse172 (select (select .cse173 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse169 (store (store .cse173 .cse171 (store (select .cse173 .cse171) .cse172 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse169 (select (select (store (store .cse170 .cse171 (store (select .cse170 .cse171) .cse172 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse169 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse163 (select (select .cse168 .cse165) .cse166))) (or (= .cse162 (_ bv0 32)) (= .cse163 (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse164 .cse165) .cse166))) (= .cse167 .cse162) (= .cse167 .cse163)))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse197 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse194 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse195 (select (select .cse194 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse196 (select (select .cse197 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse188 (store (store .cse197 .cse195 (store (select .cse197 .cse195) .cse196 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse184 (store (store .cse194 .cse195 (store (select .cse194 .cse195) .cse196 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse185 (select (select .cse184 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse186 (select (select .cse188 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse187 (let ((.cse193 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse190 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse191 (select (select .cse190 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse192 (select (select .cse193 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse189 (store (store .cse193 .cse191 (store (select .cse193 .cse191) .cse192 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse189 (select (select (store (store .cse190 .cse191 (store (select .cse190 .cse191) .cse192 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse189 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse183 (select (select .cse188 .cse185) .cse186))) (or (= .cse183 (_ bv0 32)) (not (= (select (select .cse184 .cse185) .cse186) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (= .cse187 (_ bv0 32)) (= .cse187 .cse183)))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse202 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse199 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse200 (select (select .cse199 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse201 (select (select .cse202 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse198 (store (store .cse202 .cse200 (store (select .cse202 .cse200) .cse201 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse198 (select (select (store (store .cse199 .cse200 (store (select .cse199 .cse200) .cse201 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse198 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse223 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse220 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse221 (select (select .cse220 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse222 (select (select .cse223 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse209 (store (store .cse223 .cse221 (store (select .cse223 .cse221) .cse222 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse205 (store (store .cse220 .cse221 (store (select .cse220 .cse221) .cse222 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse206 (select (select .cse205 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse207 (select (select .cse209 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse203 (let ((.cse219 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse216 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse217 (select (select .cse216 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse218 (select (select .cse219 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse215 (store (store .cse219 .cse217 (store (select .cse219 .cse217) .cse218 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse215 (select (select (store (store .cse216 .cse217 (store (select .cse216 .cse217) .cse218 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse215 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse208 (let ((.cse214 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse211 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse212 (select (select .cse211 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse213 (select (select .cse214 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse210 (store (store .cse214 .cse212 (store (select .cse214 .cse212) .cse213 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse210 (select (select (store (store .cse211 .cse212 (store (select .cse211 .cse212) .cse213 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse210 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse204 (select (select .cse209 .cse206) .cse207))) (or (= .cse203 .cse204) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse205 .cse206) .cse207))) (= .cse208 .cse203) (= .cse208 .cse204) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))))))) .cse0) (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse231 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse228 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse229 (select (select .cse228 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse230 (select (select .cse231 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse224 (store (store .cse231 .cse229 (store (select .cse231 .cse229) .cse230 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse227 (store (store .cse228 .cse229 (store (select .cse228 .cse229) .cse230 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse225 (select (select .cse227 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse226 (select (select .cse224 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse224 .cse225) .cse226) (_ bv0 32)) (not (= (select (select .cse227 .cse225) .cse226) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)))))))) (= (let ((.cse236 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse233 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse234 (select (select .cse233 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse235 (select (select .cse236 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse232 (store (store .cse236 .cse234 (store (select .cse236 .cse234) .cse235 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse232 (select (select (store (store .cse233 .cse234 (store (select .cse233 .cse234) .cse235 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse232 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (= (let ((.cse241 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse238 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse239 (select (select .cse238 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse240 (select (select .cse241 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse237 (store (store .cse241 .cse239 (store (select .cse241 .cse239) .cse240 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse237 (select (select (store (store .cse238 .cse239 (store (select .cse238 .cse239) .cse240 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse237 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse261 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse258 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse259 (select (select .cse258 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse260 (select (select .cse261 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse243 (store (store .cse261 .cse259 (store (select .cse261 .cse259) .cse260 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse246 (store (store .cse258 .cse259 (store (select .cse258 .cse259) .cse260 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse244 (select (select .cse246 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse245 (select (select .cse243 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse247 (let ((.cse257 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse254 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse255 (select (select .cse254 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse256 (select (select .cse257 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse253 (store (store .cse257 .cse255 (store (select .cse257 .cse255) .cse256 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse253 (select (select (store (store .cse254 .cse255 (store (select .cse254 .cse255) .cse256 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse253 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse242 (let ((.cse252 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse249 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse250 (select (select .cse249 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse251 (select (select .cse252 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse248 (store (store .cse252 .cse250 (store (select .cse252 .cse250) .cse251 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse248 (select (select (store (store .cse249 .cse250 (store (select .cse249 .cse250) .cse251 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse248 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse242 (select (select .cse243 .cse244) .cse245)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse246 .cse244) .cse245))) (= .cse247 (_ bv0 32)) (= .cse247 .cse242) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))))) .cse0) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_31 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_30 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse266 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_31)) (.cse263 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_32))) (let ((.cse264 (select (select .cse263 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse265 (select (select .cse266 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse262 (store (store .cse263 .cse264 (store (select .cse263 .cse264) .cse265 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_30))) (select .cse262 (select (select .cse262 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse266 .cse264 (store (select .cse266 .cse264) .cse265 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_29) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse285 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse282 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse283 (select (select .cse282 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse284 (select (select .cse285 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse276 (store (store .cse285 .cse283 (store (select .cse285 .cse283) .cse284 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse267 (store (store .cse282 .cse283 (store (select .cse282 .cse283) .cse284 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse270 (let ((.cse281 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse278 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse279 (select (select .cse278 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse280 (select (select .cse281 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse277 (store (store .cse281 .cse279 (store (select .cse281 .cse279) .cse280 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse277 (select (select (store (store .cse278 .cse279 (store (select .cse278 .cse279) .cse280 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse277 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse268 (select (select .cse267 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse269 (select (select .cse276 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse267 .cse268) .cse269))) (= .cse270 (let ((.cse275 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse272 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse273 (select (select .cse272 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse274 (select (select .cse275 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse271 (store (store .cse275 .cse273 (store (select .cse275 .cse273) .cse274 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse271 (select (select (store (store .cse272 .cse273 (store (select .cse272 .cse273) .cse274 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse271 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (= .cse270 (select (select .cse276 .cse268) .cse269)) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))))) .cse0) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse298 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse295 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse296 (select (select .cse295 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse297 (select (select .cse298 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse291 (store (store .cse298 .cse296 (store (select .cse298 .cse296) .cse297 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse294 (store (store .cse295 .cse296 (store (select .cse295 .cse296) .cse297 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse292 (select (select .cse294 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse293 (select (select .cse291 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (let ((.cse290 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse287 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse288 (select (select .cse287 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse289 (select (select .cse290 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse286 (store (store .cse290 .cse288 (store (select .cse290 .cse288) .cse289 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse286 (select (select (store (store .cse287 .cse288 (store (select .cse287 .cse288) .cse289 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse286 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (= (select (select .cse291 .cse292) .cse293) (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse294 .cse292) .cse293))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))))) .cse0) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse303 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse300 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse301 (select (select .cse300 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse302 (select (select .cse303 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse299 (store (store .cse300 .cse301 (store (select .cse300 .cse301) .cse302 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (select .cse299 (select (select .cse299 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse303 .cse301 (store (select .cse303 .cse301) .cse302 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) .cse0) (or .cse0 (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse322 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse319 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse320 (select (select .cse319 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse321 (select (select .cse322 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse304 (store (store .cse322 .cse320 (store (select .cse322 .cse320) .cse321 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse308 (store (store .cse319 .cse320 (store (select .cse319 .cse320) .cse321 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse305 (select (select .cse308 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse306 (select (select .cse304 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse307 (let ((.cse318 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse315 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse316 (select (select .cse315 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse317 (select (select .cse318 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse314 (store (store .cse318 .cse316 (store (select .cse318 .cse316) .cse317 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse314 (select (select (store (store .cse315 .cse316 (store (select .cse315 .cse316) .cse317 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse314 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= (select (select .cse304 .cse305) .cse306) .cse307) (not (= (select (select .cse308 .cse305) .cse306) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (= .cse307 (_ bv0 32)) (= (let ((.cse313 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse310 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse311 (select (select .cse310 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse312 (select (select .cse313 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse309 (store (store .cse313 .cse311 (store (select .cse313 .cse311) .cse312 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse309 (select (select (store (store .cse310 .cse311 (store (select .cse310 .cse311) .cse312 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse309 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse341 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse338 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse339 (select (select .cse338 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse340 (select (select .cse341 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse337 (store (store .cse341 .cse339 (store (select .cse341 .cse339) .cse340 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse329 (store (store .cse338 .cse339 (store (select .cse338 .cse339) .cse340 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse330 (select (select .cse329 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse331 (select (select .cse337 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse323 (select (select .cse337 .cse330) .cse331))) (or (= .cse323 (let ((.cse328 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse325 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse326 (select (select .cse325 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse327 (select (select .cse328 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse324 (store (store .cse328 .cse326 (store (select .cse328 .cse326) .cse327 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse324 (select (select (store (store .cse325 .cse326 (store (select .cse325 .cse326) .cse327 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse324 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (= .cse323 (_ bv0 32)) (not (= (select (select .cse329 .cse330) .cse331) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (= (let ((.cse336 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse333 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse334 (select (select .cse333 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse335 (select (select .cse336 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse332 (store (store .cse336 .cse334 (store (select .cse336 .cse334) .cse335 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse332 (select (select (store (store .cse333 .cse334 (store (select .cse333 .cse334) .cse335 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse332 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) .cse323)))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse360 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse357 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse358 (select (select .cse357 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse359 (select (select .cse360 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse356 (store (store .cse360 .cse358 (store (select .cse360 .cse358) .cse359 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse348 (store (store .cse357 .cse358 (store (select .cse357 .cse358) .cse359 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse349 (select (select .cse348 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse350 (select (select .cse356 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse347 (select (select .cse356 .cse349) .cse350))) (or (= (let ((.cse346 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse343 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse344 (select (select .cse343 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse345 (select (select .cse346 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse342 (store (store .cse346 .cse344 (store (select .cse346 .cse344) .cse345 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse342 (select (select (store (store .cse343 .cse344 (store (select .cse343 .cse344) .cse345 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse342 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) .cse347) (= .cse347 (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse348 .cse349) .cse350))) (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse355 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse352 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse353 (select (select .cse352 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse354 (select (select .cse355 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse351 (store (store .cse355 .cse353 (store (select .cse355 .cse353) .cse354 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse351 (select (select (store (store .cse352 .cse353 (store (select .cse352 .cse353) .cse354 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse351 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) .cse347))))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (let ((.cse365 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse362 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse363 (select (select .cse362 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse364 (select (select .cse365 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse361 (store (store .cse362 .cse363 (store (select .cse362 .cse363) .cse364 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (select .cse361 (select (select .cse361 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse365 .cse363 (store (select .cse365 .cse363) .cse364 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse373 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse370 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse371 (select (select .cse370 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse372 (select (select .cse373 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse366 (store (store .cse373 .cse371 (store (select .cse373 .cse371) .cse372 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse369 (store (store .cse370 .cse371 (store (select .cse370 .cse371) .cse372 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse367 (select (select .cse369 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse368 (select (select .cse366 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse366 .cse367) .cse368) (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse369 .cse367) .cse368))))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse388 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse385 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse386 (select (select .cse385 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse387 (select (select .cse388 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse384 (store (store .cse388 .cse386 (store (select .cse388 .cse386) .cse387 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse381 (store (store .cse385 .cse386 (store (select .cse385 .cse386) .cse387 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse382 (select (select .cse381 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse383 (select (select .cse384 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse375 (select (select .cse384 .cse382) .cse383))) (or (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse374 (let ((.cse380 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse377 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse378 (select (select .cse377 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse379 (select (select .cse380 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse376 (store (store .cse380 .cse378 (store (select .cse380 .cse378) .cse379 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse376 (select (select (store (store .cse377 .cse378 (store (select .cse377 .cse378) .cse379 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse376 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse374 (_ bv0 32)) (= .cse374 .cse375)))) (= .cse375 (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse381 .cse382) .cse383)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse407 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse404 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse405 (select (select .cse404 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse406 (select (select .cse407 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse393 (store (store .cse407 .cse405 (store (select .cse407 .cse405) .cse406 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse389 (store (store .cse404 .cse405 (store (select .cse404 .cse405) .cse406 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse390 (select (select .cse389 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse391 (select (select .cse393 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse392 (let ((.cse403 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse400 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse401 (select (select .cse400 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse402 (select (select .cse403 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse399 (store (store .cse403 .cse401 (store (select .cse403 .cse401) .cse402 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse399 (select (select (store (store .cse400 .cse401 (store (select .cse400 .cse401) .cse402 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse399 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (not (= (select (select .cse389 .cse390) .cse391) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (= .cse392 (select (select .cse393 .cse390) .cse391)) (= .cse392 (let ((.cse398 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse395 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse396 (select (select .cse395 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse397 (select (select .cse398 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse394 (store (store .cse398 .cse396 (store (select .cse398 .cse396) .cse397 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse394 (select (select (store (store .cse395 .cse396 (store (select .cse395 .cse396) .cse397 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse394 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))))) .cse0) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse414 (let ((.cse424 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse421 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse422 (select (select .cse421 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse423 (select (select .cse424 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse420 (store (store .cse424 .cse422 (store (select .cse424 .cse422) .cse423 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse420 (select (select (store (store .cse421 .cse422 (store (select .cse421 .cse422) .cse423 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse420 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse413 (let ((.cse419 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse416 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse417 (select (select .cse416 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse418 (select (select .cse419 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse415 (store (store .cse419 .cse417 (store (select .cse419 .cse417) .cse418 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse415 (select (select (store (store .cse416 .cse417 (store (select .cse416 .cse417) .cse418 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse415 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (not (= (let ((.cse412 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse409 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse410 (select (select .cse409 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse411 (select (select .cse412 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse408 (store (store .cse409 .cse410 (store (select .cse409 .cse410) .cse411 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (select .cse408 (select (select .cse408 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse412 .cse410 (store (select .cse412 .cse410) .cse411 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (= .cse413 (_ bv0 32)) (= .cse414 (_ bv0 32)) (= .cse414 .cse413) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))) .cse0) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse445 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse442 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse443 (select (select .cse442 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse444 (select (select .cse445 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse441 (store (store .cse445 .cse443 (store (select .cse445 .cse443) .cse444 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse438 (store (store .cse442 .cse443 (store (select .cse442 .cse443) .cse444 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse439 (select (select .cse438 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse440 (select (select .cse441 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse425 (select (select .cse441 .cse439) .cse440))) (or (= .cse425 (_ bv0 32)) (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse427 (let ((.cse437 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse434 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse435 (select (select .cse434 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse436 (select (select .cse437 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse433 (store (store .cse437 .cse435 (store (select .cse437 .cse435) .cse436 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse433 (select (select (store (store .cse434 .cse435 (store (select .cse434 .cse435) .cse436 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse433 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse426 (let ((.cse432 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse429 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse430 (select (select .cse429 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse431 (select (select .cse432 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse428 (store (store .cse432 .cse430 (store (select .cse432 .cse430) .cse431 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse428 (select (select (store (store .cse429 .cse430 (store (select .cse429 .cse430) .cse431 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse428 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse425 .cse426) (= .cse427 (_ bv0 32)) (= .cse427 .cse426)))) (not (= (select (select .cse438 .cse439) .cse440) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|))))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (let ((.cse450 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse447 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse448 (select (select .cse447 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse449 (select (select .cse450 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse446 (store (store .cse450 .cse448 (store (select .cse450 .cse448) .cse449 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse446 (select (select (store (store .cse447 .cse448 (store (select .cse447 .cse448) .cse449 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse446 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse458 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse455 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse456 (select (select .cse455 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse457 (select (select .cse458 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse451 (store (store .cse458 .cse456 (store (select .cse458 .cse456) .cse457 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse454 (store (store .cse455 .cse456 (store (select .cse455 .cse456) .cse457 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse452 (select (select .cse454 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse453 (select (select .cse451 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse451 .cse452) .cse453) (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse454 .cse452) .cse453))))))))) (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse463 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse460 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse461 (select (select .cse460 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse462 (select (select .cse463 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse459 (store (store .cse463 .cse461 (store (select .cse463 .cse461) .cse462 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse459 (select (select (store (store .cse460 .cse461 (store (select .cse460 .cse461) .cse462 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse459 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse468 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse465 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse466 (select (select .cse465 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse467 (select (select .cse468 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse464 (store (store .cse465 .cse466 (store (select .cse465 .cse466) .cse467 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (select .cse464 (select (select .cse464 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse468 .cse466 (store (select .cse468 .cse466) .cse467 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (= (let ((.cse473 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse470 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse471 (select (select .cse470 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse472 (select (select .cse473 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse469 (store (store .cse473 .cse471 (store (select .cse473 .cse471) .cse472 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse469 (select (select (store (store .cse470 .cse471 (store (select .cse470 .cse471) .cse472 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse469 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (= (let ((.cse478 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse475 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse476 (select (select .cse475 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse477 (select (select .cse478 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse474 (store (store .cse478 .cse476 (store (select .cse478 .cse476) .cse477 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse474 (select (select (store (store .cse475 .cse476 (store (select .cse475 .cse476) .cse477 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse474 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) .cse0) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse483 (let ((.cse498 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse495 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse496 (select (select .cse495 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse497 (select (select .cse498 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse494 (store (store .cse498 .cse496 (store (select .cse498 .cse496) .cse497 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse494 (select (select (store (store .cse495 .cse496 (store (select .cse495 .cse496) .cse497 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse494 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse488 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse485 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse486 (select (select .cse485 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse487 (select (select .cse488 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse484 (store (store .cse488 .cse486 (store (select .cse488 .cse486) .cse487 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse480 (store (store .cse485 .cse486 (store (select .cse485 .cse486) .cse487 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse481 (select (select .cse480 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse482 (select (select .cse484 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse479 (select (select .cse484 .cse481) .cse482))) (or (= .cse479 (_ bv0 32)) (not (= (select (select .cse480 .cse481) .cse482) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (= .cse483 .cse479)))))))) (= .cse483 (let ((.cse493 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse490 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse491 (select (select .cse490 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse492 (select (select .cse493 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse489 (store (store .cse493 .cse491 (store (select .cse493 .cse491) .cse492 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse489 (select (select (store (store .cse490 .cse491 (store (select .cse490 .cse491) .cse492 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse489 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))) (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse506 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse503 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse504 (select (select .cse503 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse505 (select (select .cse506 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse502 (store (store .cse506 .cse504 (store (select .cse506 .cse504) .cse505 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse499 (store (store .cse503 .cse504 (store (select .cse503 .cse504) .cse505 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse500 (select (select .cse499 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse501 (select (select .cse502 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse499 .cse500) .cse501) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (not (= (bvadd (_ bv4 32) (select (select .cse502 .cse500) .cse501)) (_ bv0 32))))))))))) (or (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse514 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse511 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse512 (select (select .cse511 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse513 (select (select .cse514 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse510 (store (store .cse514 .cse512 (store (select .cse514 .cse512) .cse513 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281)) (.cse507 (store (store .cse511 .cse512 (store (select .cse511 .cse512) .cse513 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274))) (let ((.cse508 (select (select .cse507 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse509 (select (select .cse510 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse507 .cse508) .cse509) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (= (select (select .cse510 .cse508) .cse509) (_ bv0 32)) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))))) .cse0) (or .cse0 (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse528 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse525 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse526 (select (select .cse525 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse527 (select (select .cse528 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse524 (store (store .cse528 .cse526 (store (select .cse528 .cse526) .cse527 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281)) (.cse515 (store (store .cse525 .cse526 (store (select .cse525 .cse526) .cse527 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274))) (let ((.cse516 (select (select .cse515 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse517 (select (select .cse524 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse518 (select (select .cse524 .cse516) .cse517))) (or (= (select (select .cse515 .cse516) .cse517) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (= .cse518 (_ bv0 32)) (= .cse518 (let ((.cse523 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse520 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse521 (select (select .cse520 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse522 (select (select .cse523 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse519 (store (store .cse523 .cse521 (store (select .cse523 .cse521) .cse522 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse519 (select (select (store (store .cse520 .cse521 (store (select .cse520 .cse521) .cse522 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse519 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse549 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse546 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse547 (select (select .cse546 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse548 (select (select .cse549 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse545 (store (store .cse549 .cse547 (store (select .cse549 .cse547) .cse548 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281)) (.cse542 (store (store .cse546 .cse547 (store (select .cse546 .cse547) .cse548 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274))) (let ((.cse543 (select (select .cse542 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse544 (select (select .cse545 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse529 (select (select .cse545 .cse543) .cse544))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse530 (let ((.cse541 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse538 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse539 (select (select .cse538 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse540 (select (select .cse541 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse537 (store (store .cse541 .cse539 (store (select .cse541 .cse539) .cse540 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse537 (select (select (store (store .cse538 .cse539 (store (select .cse538 .cse539) .cse540 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse537 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse529 .cse530) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse531 (let ((.cse536 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse533 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse534 (select (select .cse533 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse535 (select (select .cse536 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse532 (store (store .cse536 .cse534 (store (select .cse536 .cse534) .cse535 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse532 (select (select (store (store .cse533 .cse534 (store (select .cse533 .cse534) .cse535 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse532 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse530 .cse531) (= .cse531 (_ bv0 32)))))))) (= (select (select .cse542 .cse543) .cse544) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (= .cse529 (_ bv0 32))))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse569 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse566 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse567 (select (select .cse566 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse568 (select (select .cse569 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse560 (store (store .cse569 .cse567 (store (select .cse569 .cse567) .cse568 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse556 (store (store .cse566 .cse567 (store (select .cse566 .cse567) .cse568 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse557 (select (select .cse556 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse558 (select (select .cse560 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse559 (let ((.cse565 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse562 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse563 (select (select .cse562 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse564 (select (select .cse565 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse561 (store (store .cse565 .cse563 (store (select .cse565 .cse563) .cse564 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse561 (select (select (store (store .cse562 .cse563 (store (select .cse562 .cse563) .cse564 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse561 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse555 (select (select .cse560 .cse557) .cse558))) (or (= (let ((.cse554 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse551 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse552 (select (select .cse551 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse553 (select (select .cse554 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse550 (store (store .cse554 .cse552 (store (select .cse554 .cse552) .cse553 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse550 (select (select (store (store .cse551 .cse552 (store (select .cse551 .cse552) .cse553 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse550 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) .cse555) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse556 .cse557) .cse558))) (= .cse559 (_ bv0 32)) (= .cse559 .cse555) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))))))) .cse0) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse570 (let ((.cse590 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse587 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse588 (select (select .cse587 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse589 (select (select .cse590 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse586 (store (store .cse590 .cse588 (store (select .cse590 .cse588) .cse589 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse586 (select (select (store (store .cse587 .cse588 (store (select .cse587 .cse588) .cse589 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse586 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse570 (_ bv0 32)) (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse571 (let ((.cse585 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse582 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse583 (select (select .cse582 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse584 (select (select .cse585 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse581 (store (store .cse585 .cse583 (store (select .cse585 .cse583) .cse584 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse581 (select (select (store (store .cse582 .cse583 (store (select .cse582 .cse583) .cse584 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse581 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse580 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse577 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse578 (select (select .cse577 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse579 (select (select .cse580 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse576 (store (store .cse580 .cse578 (store (select .cse580 .cse578) .cse579 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse573 (store (store .cse577 .cse578 (store (select .cse577 .cse578) .cse579 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse574 (select (select .cse573 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse575 (select (select .cse576 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse572 (select (select .cse576 .cse574) .cse575))) (or (= .cse571 .cse572) (= .cse572 (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse573 .cse574) .cse575)))))))))) (= .cse570 .cse571))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (or (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse595 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse592 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse593 (select (select .cse592 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse594 (select (select .cse595 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse591 (store (store .cse592 .cse593 (store (select .cse592 .cse593) .cse594 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274))) (select .cse591 (select (select .cse591 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse595 .cse593 (store (select .cse595 .cse593) .cse594 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse608 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse605 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse606 (select (select .cse605 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse607 (select (select .cse608 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse599 (store (store .cse608 .cse606 (store (select .cse608 .cse606) .cse607 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281)) (.cse596 (store (store .cse605 .cse606 (store (select .cse605 .cse606) .cse607 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274))) (let ((.cse597 (select (select .cse596 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse598 (select (select .cse599 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse596 .cse597) .cse598) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (= (select (select .cse599 .cse597) .cse598) (let ((.cse604 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse601 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse602 (select (select .cse601 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse603 (select (select .cse604 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse600 (store (store .cse604 .cse602 (store (select .cse604 .cse602) .cse603 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse600 (select (select (store (store .cse601 .cse602 (store (select .cse601 .cse602) .cse603 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse600 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))) .cse0) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse609 (let ((.cse628 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse625 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse626 (select (select .cse625 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse627 (select (select .cse628 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse624 (store (store .cse628 .cse626 (store (select .cse628 .cse626) .cse627 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse624 (select (select (store (store .cse625 .cse626 (store (select .cse625 .cse626) .cse627 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse624 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse609 (_ bv0 32)) (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse623 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse620 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse621 (select (select .cse620 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse622 (select (select .cse623 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse619 (store (store .cse623 .cse621 (store (select .cse623 .cse621) .cse622 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse611 (store (store .cse620 .cse621 (store (select .cse620 .cse621) .cse622 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse612 (select (select .cse611 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse613 (select (select .cse619 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse610 (select (select .cse619 .cse612) .cse613))) (or (= .cse610 (_ bv0 32)) (not (= (select (select .cse611 .cse612) .cse613) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (= .cse609 .cse610) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse610 (let ((.cse618 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse615 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse616 (select (select .cse615 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse617 (select (select .cse618 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse614 (store (store .cse618 .cse616 (store (select .cse618 .cse616) .cse617 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse614 (select (select (store (store .cse615 .cse616 (store (select .cse615 .cse616) .cse617 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse614 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))))))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (or (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse629 (let ((.cse648 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse645 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse646 (select (select .cse645 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse647 (select (select .cse648 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse644 (store (store .cse648 .cse646 (store (select .cse648 .cse646) .cse647 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse644 (select (select (store (store .cse645 .cse646 (store (select .cse645 .cse646) .cse647 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse644 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse629 (_ bv0 32)) (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse643 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse640 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse641 (select (select .cse640 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse642 (select (select .cse643 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse639 (store (store .cse643 .cse641 (store (select .cse643 .cse641) .cse642 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse630 (store (store .cse640 .cse641 (store (select .cse640 .cse641) .cse642 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse631 (select (select .cse630 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse632 (select (select .cse639 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse633 (select (select .cse639 .cse631) .cse632))) (or (not (= (select (select .cse630 .cse631) .cse632) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (= .cse629 .cse633) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse633 (let ((.cse638 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse635 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse636 (select (select .cse635 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse637 (select (select .cse638 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse634 (store (store .cse638 .cse636 (store (select .cse638 .cse636) .cse637 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse634 (select (select (store (store .cse635 .cse636 (store (select .cse635 .cse636) .cse637 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse634 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))))))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse662 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse659 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse660 (select (select .cse659 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse661 (select (select .cse662 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse653 (store (store .cse662 .cse660 (store (select .cse662 .cse660) .cse661 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse649 (store (store .cse659 .cse660 (store (select .cse659 .cse660) .cse661 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse652 (let ((.cse658 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse655 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse656 (select (select .cse655 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse657 (select (select .cse658 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse654 (store (store .cse658 .cse656 (store (select .cse658 .cse656) .cse657 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse654 (select (select (store (store .cse655 .cse656 (store (select .cse655 .cse656) .cse657 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse654 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse650 (select (select .cse649 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse651 (select (select .cse653 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse649 .cse650) .cse651) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (= .cse652 (_ bv0 32)) (= .cse652 (select (select .cse653 .cse650) .cse651)))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse667 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse664 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse665 (select (select .cse664 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse666 (select (select .cse667 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse663 (store (store .cse667 .cse665 (store (select .cse667 .cse665) .cse666 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse663 (select (select (store (store .cse664 .cse665 (store (select .cse664 .cse665) .cse666 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse663 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))) .cse0) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse682 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse679 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse680 (select (select .cse679 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse681 (select (select .cse682 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse678 (store (store .cse682 .cse680 (store (select .cse682 .cse680) .cse681 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281)) (.cse669 (store (store .cse679 .cse680 (store (select .cse679 .cse680) .cse681 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274))) (let ((.cse670 (select (select .cse669 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse671 (select (select .cse678 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse672 (select (select .cse678 .cse670) .cse671)) (.cse668 (let ((.cse677 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse674 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse675 (select (select .cse674 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse676 (select (select .cse677 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse673 (store (store .cse677 .cse675 (store (select .cse677 .cse675) .cse676 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse673 (select (select (store (store .cse674 .cse675 (store (select .cse674 .cse675) .cse676 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse673 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse668 (_ bv0 32)) (= (select (select .cse669 .cse670) .cse671) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (= .cse672 (_ bv0 32)) (= .cse672 .cse668)))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse687 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse684 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse685 (select (select .cse684 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse686 (select (select .cse687 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse683 (store (store .cse687 .cse685 (store (select .cse687 .cse685) .cse686 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse683 (select (select (store (store .cse684 .cse685 (store (select .cse684 .cse685) .cse686 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse683 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse693 (let ((.cse703 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse700 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse701 (select (select .cse700 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse702 (select (select .cse703 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse699 (store (store .cse703 .cse701 (store (select .cse703 .cse701) .cse702 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse699 (select (select (store (store .cse700 .cse701 (store (select .cse700 .cse701) .cse702 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse699 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (let ((.cse692 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse689 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse690 (select (select .cse689 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse691 (select (select .cse692 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse688 (store (store .cse689 .cse690 (store (select .cse689 .cse690) .cse691 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (select .cse688 (select (select .cse688 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse692 .cse690 (store (select .cse692 .cse690) .cse691 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (= .cse693 (_ bv0 32)) (= .cse693 (let ((.cse698 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse695 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse696 (select (select .cse695 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse697 (select (select .cse698 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse694 (store (store .cse698 .cse696 (store (select .cse698 .cse696) .cse697 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse694 (select (select (store (store .cse695 .cse696 (store (select .cse695 .cse696) .cse697 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse694 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))) .cse0) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse716 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse713 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse714 (select (select .cse713 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse715 (select (select .cse716 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse707 (store (store .cse716 .cse714 (store (select .cse716 .cse714) .cse715 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281)) (.cse704 (store (store .cse713 .cse714 (store (select .cse713 .cse714) .cse715 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274))) (let ((.cse705 (select (select .cse704 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse706 (select (select .cse707 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse704 .cse705) .cse706) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (= (select (select .cse707 .cse705) .cse706) (let ((.cse712 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse709 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse710 (select (select .cse709 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse711 (select (select .cse712 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse708 (store (store .cse712 .cse710 (store (select .cse712 .cse710) .cse711 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse708 (select (select (store (store .cse709 .cse710 (store (select .cse709 .cse710) .cse711 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse708 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))))) .cse0) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse720 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_36))) (let ((.cse718 (select (select .cse720 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse717 (let ((.cse722 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_35))) (let ((.cse721 (select (select .cse722 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse719 (store (store .cse720 .cse718 (store (select .cse720 .cse718) .cse721 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_34))) (select .cse719 (select (select .cse719 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse722 .cse718 (store (select .cse722 .cse718) .cse721 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| .cse717) (not (= .cse718 .cse717))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse723 (let ((.cse737 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse734 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse735 (select (select .cse734 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse736 (select (select .cse737 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse733 (store (store .cse737 .cse735 (store (select .cse737 .cse735) .cse736 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse733 (select (select (store (store .cse734 .cse735 (store (select .cse734 .cse735) .cse736 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse733 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse723 (_ bv0 32)) (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse732 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse729 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse730 (select (select .cse729 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse731 (select (select .cse732 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse728 (store (store .cse732 .cse730 (store (select .cse732 .cse730) .cse731 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse725 (store (store .cse729 .cse730 (store (select .cse729 .cse730) .cse731 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse726 (select (select .cse725 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse727 (select (select .cse728 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse724 (select (select .cse728 .cse726) .cse727))) (or (= .cse724 .cse723) (= .cse724 (_ bv0 32)) (not (= (select (select .cse725 .cse726) .cse727) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)))))))))))) (= (let ((.cse742 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse739 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse740 (select (select .cse739 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse741 (select (select .cse742 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse738 (store (store .cse742 .cse740 (store (select .cse742 .cse740) .cse741 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse738 (select (select (store (store .cse739 .cse740 (store (select .cse739 .cse740) .cse741 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse738 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse752 (let ((.cse762 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse759 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse760 (select (select .cse759 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse761 (select (select .cse762 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse758 (store (store .cse762 .cse760 (store (select .cse762 .cse760) .cse761 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse758 (select (select (store (store .cse759 .cse760 (store (select .cse759 .cse760) .cse761 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse758 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse751 (let ((.cse757 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse754 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse755 (select (select .cse754 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse756 (select (select .cse757 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse753 (store (store .cse757 .cse755 (store (select .cse757 .cse755) .cse756 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse753 (select (select (store (store .cse754 .cse755 (store (select .cse754 .cse755) .cse756 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse753 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse750 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse747 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse748 (select (select .cse747 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse749 (select (select .cse750 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse743 (store (store .cse750 .cse748 (store (select .cse750 .cse748) .cse749 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse746 (store (store .cse747 .cse748 (store (select .cse747 .cse748) .cse749 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse744 (select (select .cse746 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse745 (select (select .cse743 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse743 .cse744) .cse745) (_ bv0 32)) (not (= (select (select .cse746 .cse744) .cse745) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)))))))) (= .cse751 (_ bv0 32)) (= .cse752 (_ bv0 32)) (= .cse752 .cse751) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))) (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse777 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse774 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse775 (select (select .cse774 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse776 (select (select .cse777 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse773 (store (store .cse777 .cse775 (store (select .cse777 .cse775) .cse776 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse770 (store (store .cse774 .cse775 (store (select .cse774 .cse775) .cse776 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse771 (select (select .cse770 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse772 (select (select .cse773 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse764 (select (select .cse773 .cse771) .cse772))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse763 (let ((.cse769 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse766 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse767 (select (select .cse766 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse768 (select (select .cse769 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse765 (store (store .cse769 .cse767 (store (select .cse769 .cse767) .cse768 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse765 (select (select (store (store .cse766 .cse767 (store (select .cse766 .cse767) .cse768 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse765 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse763 .cse764) (= .cse763 (_ bv0 32))))) (= .cse764 (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse770 .cse771) .cse772)))))))))) (= (let ((.cse782 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse779 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse780 (select (select .cse779 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse781 (select (select .cse782 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse778 (store (store .cse782 .cse780 (store (select .cse782 .cse780) .cse781 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse778 (select (select (store (store .cse779 .cse780 (store (select .cse779 .cse780) .cse781 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse778 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (or (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse795 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse792 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse793 (select (select .cse792 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse794 (select (select .cse795 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse791 (store (store .cse795 .cse793 (store (select .cse795 .cse793) .cse794 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281)) (.cse783 (store (store .cse792 .cse793 (store (select .cse792 .cse793) .cse794 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274))) (let ((.cse784 (select (select .cse783 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse785 (select (select .cse791 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse783 .cse784) .cse785) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (= (let ((.cse790 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse787 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse788 (select (select .cse787 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse789 (select (select .cse790 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse786 (store (store .cse790 .cse788 (store (select .cse790 .cse788) .cse789 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse786 (select (select (store (store .cse787 .cse788 (store (select .cse787 .cse788) .cse789 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse786 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (= (select (select .cse791 .cse784) .cse785) (_ bv0 32)) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))))) .cse0) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse814 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse811 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse812 (select (select .cse811 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse813 (select (select .cse814 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse810 (store (store .cse814 .cse812 (store (select .cse814 .cse812) .cse813 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281)) (.cse796 (store (store .cse811 .cse812 (store (select .cse811 .cse812) .cse813 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274))) (let ((.cse797 (select (select .cse796 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse798 (select (select .cse810 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse799 (select (select .cse810 .cse797) .cse798))) (or (= (select (select .cse796 .cse797) .cse798) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (= .cse799 (_ bv0 32)) (= .cse799 (let ((.cse804 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse801 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse802 (select (select .cse801 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse803 (select (select .cse804 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse800 (store (store .cse804 .cse802 (store (select .cse804 .cse802) .cse803 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse800 (select (select (store (store .cse801 .cse802 (store (select .cse801 .cse802) .cse803 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse800 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (= .cse799 (let ((.cse809 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse806 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse807 (select (select .cse806 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse808 (select (select .cse809 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse805 (store (store .cse809 .cse807 (store (select .cse809 .cse807) .cse808 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse805 (select (select (store (store .cse806 .cse807 (store (select .cse806 .cse807) .cse808 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse805 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse833 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse830 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse831 (select (select .cse830 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse832 (select (select .cse833 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse829 (store (store .cse833 .cse831 (store (select .cse833 .cse831) .cse832 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse821 (store (store .cse830 .cse831 (store (select .cse830 .cse831) .cse832 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse822 (select (select .cse821 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse823 (select (select .cse829 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse820 (select (select .cse829 .cse822) .cse823))) (or (= (let ((.cse819 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse816 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse817 (select (select .cse816 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse818 (select (select .cse819 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse815 (store (store .cse819 .cse817 (store (select .cse819 .cse817) .cse818 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse815 (select (select (store (store .cse816 .cse817 (store (select .cse816 .cse817) .cse818 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse815 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) .cse820) (= .cse820 (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse821 .cse822) .cse823))) (= (let ((.cse828 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse825 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse826 (select (select .cse825 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse827 (select (select .cse828 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse824 (store (store .cse828 .cse826 (store (select .cse828 .cse826) .cse827 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse824 (select (select (store (store .cse825 .cse826 (store (select .cse825 .cse826) .cse827 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse824 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32)) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))))))) .cse0) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse847 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse844 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse845 (select (select .cse844 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse846 (select (select .cse847 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse843 (store (store .cse847 .cse845 (store (select .cse847 .cse845) .cse846 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281)) (.cse834 (store (store .cse844 .cse845 (store (select .cse844 .cse845) .cse846 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274))) (let ((.cse835 (select (select .cse834 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse836 (select (select .cse843 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse837 (select (select .cse843 .cse835) .cse836))) (or (= (select (select .cse834 .cse835) .cse836) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (= .cse837 (_ bv0 32)) (= .cse837 (let ((.cse842 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse839 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse840 (select (select .cse839 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse841 (select (select .cse842 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse838 (store (store .cse842 .cse840 (store (select .cse842 .cse840) .cse841 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse838 (select (select (store (store .cse839 .cse840 (store (select .cse839 .cse840) .cse841 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse838 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))))))) .cse0) (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse866 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse863 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse864 (select (select .cse863 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse865 (select (select .cse866 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse862 (store (store .cse866 .cse864 (store (select .cse866 .cse864) .cse865 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281)) (.cse853 (store (store .cse863 .cse864 (store (select .cse863 .cse864) .cse865 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274))) (let ((.cse854 (select (select .cse853 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse855 (select (select .cse862 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse856 (select (select .cse862 .cse854) .cse855))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse852 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse849 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse850 (select (select .cse849 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse851 (select (select .cse852 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse848 (store (store .cse852 .cse850 (store (select .cse852 .cse850) .cse851 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse848 (select (select (store (store .cse849 .cse850 (store (select .cse849 .cse850) .cse851 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse848 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32))) (= (select (select .cse853 .cse854) .cse855) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (= .cse856 (_ bv0 32)) (= .cse856 (let ((.cse861 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse858 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse859 (select (select .cse858 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse860 (select (select .cse861 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse857 (store (store .cse861 .cse859 (store (select .cse861 .cse859) .cse860 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse857 (select (select (store (store .cse858 .cse859 (store (select .cse858 .cse859) .cse860 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse857 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))))))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse885 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse882 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse883 (select (select .cse882 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse884 (select (select .cse885 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse881 (store (store .cse885 .cse883 (store (select .cse885 .cse883) .cse884 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281)) (.cse867 (store (store .cse882 .cse883 (store (select .cse882 .cse883) .cse884 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274))) (let ((.cse868 (select (select .cse867 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse869 (select (select .cse881 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse870 (select (select .cse881 .cse868) .cse869))) (or (= (select (select .cse867 .cse868) .cse869) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (= .cse870 (let ((.cse875 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse872 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse873 (select (select .cse872 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse874 (select (select .cse875 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse871 (store (store .cse875 .cse873 (store (select .cse875 .cse873) .cse874 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse871 (select (select (store (store .cse872 .cse873 (store (select .cse872 .cse873) .cse874 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse871 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (= .cse870 (let ((.cse880 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse877 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse878 (select (select .cse877 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse879 (select (select .cse880 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse876 (store (store .cse880 .cse878 (store (select .cse880 .cse878) .cse879 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse876 (select (select (store (store .cse877 .cse878 (store (select .cse877 .cse878) .cse879 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse876 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))))))) .cse0) (or .cse0 (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse904 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse901 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse902 (select (select .cse901 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse903 (select (select .cse904 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse886 (store (store .cse904 .cse902 (store (select .cse904 .cse902) .cse903 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse889 (store (store .cse901 .cse902 (store (select .cse901 .cse902) .cse903 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse887 (select (select .cse889 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse888 (select (select .cse886 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse890 (let ((.cse900 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse897 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse898 (select (select .cse897 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse899 (select (select .cse900 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse896 (store (store .cse900 .cse898 (store (select .cse900 .cse898) .cse899 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse896 (select (select (store (store .cse897 .cse898 (store (select .cse897 .cse898) .cse899 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse896 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= (select (select .cse886 .cse887) .cse888) (_ bv0 32)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse889 .cse887) .cse888))) (= .cse890 (_ bv0 32)) (= .cse890 (let ((.cse895 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse892 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse893 (select (select .cse892 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse894 (select (select .cse895 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse891 (store (store .cse895 .cse893 (store (select .cse895 .cse893) .cse894 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse891 (select (select (store (store .cse892 .cse893 (store (select .cse892 .cse893) .cse894 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse891 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1)))))))))) (or .cse0 (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse923 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse920 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse921 (select (select .cse920 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse922 (select (select .cse923 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse919 (store (store .cse923 .cse921 (store (select .cse923 .cse921) .cse922 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25)) (.cse911 (store (store .cse920 .cse921 (store (select .cse920 .cse921) .cse922 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26))) (let ((.cse912 (select (select .cse911 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse913 (select (select .cse919 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse905 (select (select .cse919 .cse912) .cse913))) (or (= .cse905 (let ((.cse910 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse907 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse908 (select (select .cse907 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse909 (select (select .cse910 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse906 (store (store .cse910 .cse908 (store (select .cse910 .cse908) .cse909 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21))) (select (select .cse906 (select (select (store (store .cse907 .cse908 (store (select .cse907 .cse908) .cse909 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse906 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= (select (select .cse911 .cse912) .cse913) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) (= (let ((.cse918 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse915 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse916 (select (select .cse915 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse917 (select (select .cse918 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse914 (store (store .cse918 .cse916 (store (select .cse918 .cse916) .cse917 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse914 (select (select (store (store .cse915 .cse916 (store (select .cse915 .cse916) .cse917 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse914 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) .cse905) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (_ BitVec 32)) (v_prenex_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse943 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_23)) (.cse940 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_24))) (let ((.cse941 (select (select .cse940 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse942 (select (select .cse943 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse924 (store (store .cse943 .cse941 (store (select .cse943 .cse941) .cse942 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_21)) (.cse939 (store (store .cse940 .cse941 (store (select .cse940 .cse941) .cse942 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_22))) (let ((.cse925 (select (select .cse939 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse926 (select (select .cse924 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse924 .cse925) .cse926) (_ bv0 32)) (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse928 (let ((.cse938 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1289)) (.cse935 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1290))) (let ((.cse936 (select (select .cse935 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse937 (select (select .cse938 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse934 (store (store .cse938 .cse936 (store (select .cse938 .cse936) .cse937 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1281))) (select (select .cse934 (select (select (store (store .cse935 .cse936 (store (select .cse935 .cse936) .cse937 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_1274) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse934 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (forall ((v_prenex_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse927 (let ((.cse933 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_27)) (.cse930 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_28))) (let ((.cse931 (select (select .cse930 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse932 (select (select .cse933 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse929 (store (store .cse933 .cse931 (store (select .cse933 .cse931) .cse932 (_ bv0 32))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_25))) (select (select .cse929 (select (select (store (store .cse930 .cse931 (store (select .cse930 .cse931) .cse932 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse929 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse927 (_ bv0 32)) (= .cse928 .cse927)))) (= .cse928 (_ bv0 32))))) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| (select (select .cse939 .cse925) .cse926))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|) (_ bv0 1))))))))))) is different from true [2022-12-14 03:18:37,476 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 03:18:37,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911377883] [2022-12-14 03:18:37,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911377883] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:18:37,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [907708458] [2022-12-14 03:18:37,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:18:37,477 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 03:18:37,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 03:18:37,478 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 03:18:37,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe1212f-f326-4889-b260-ef7eb4d50edf/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-12-14 03:18:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:18:37,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-14 03:18:37,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:18:38,438 INFO L350 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 [2022-12-14 03:18:46,329 INFO L350 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 [2022-12-14 03:18:46,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 03:18:46,434 INFO L350 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 7 treesize of output 5 [2022-12-14 03:18:48,106 INFO L350 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 [2022-12-14 03:18:49,260 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 03:18:49,261 INFO L350 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 14 treesize of output 20 [2022-12-14 03:18:49,369 INFO L350 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 [2022-12-14 03:18:49,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:49,513 INFO L350 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 25 [2022-12-14 03:18:49,657 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-12-14 03:18:49,657 INFO L350 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 [2022-12-14 03:18:55,698 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 03:18:55,698 INFO L350 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 1 case distinctions, treesize of input 93 treesize of output 70 [2022-12-14 03:18:56,131 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-14 03:18:56,131 INFO L350 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 130 [2022-12-14 03:18:56,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:56,201 INFO L350 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 62 treesize of output 35 [2022-12-14 03:18:56,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:56,259 INFO L350 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 0 case distinctions, treesize of input 101 treesize of output 82 [2022-12-14 03:18:56,402 INFO L350 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 34 [2022-12-14 03:18:56,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:56,833 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-14 03:18:56,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2022-12-14 03:18:56,907 INFO L350 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 [2022-12-14 03:19:01,452 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-12-14 03:19:01,452 INFO L350 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 45 [2022-12-14 03:19:01,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:19:01,613 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 03:19:01,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-12-14 03:19:02,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 03:19:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:19:02,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:19:03,223 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1369 (_ BitVec 32)) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1363)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1368))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1367))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1369))) (select (select .cse1 .cse2) .cse3)) (bvadd (_ bv4 32) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-12-14 03:19:03,437 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1369 (_ BitVec 32)) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1363)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1368))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1367))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1369))) (select (select .cse1 .cse2) .cse3)) (bvadd (_ bv4 32) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-12-14 03:19:03,594 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1369 (_ BitVec 32)) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1363)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1368))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_1367))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1369))) (select (select .cse2 .cse3) .cse4)) (bvadd (_ bv4 32) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-12-14 03:19:05,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:19:05,703 INFO L350 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 305 treesize of output 298 [2022-12-14 03:19:05,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:19:05,869 INFO L350 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 2968 treesize of output 2840 [2022-12-14 03:19:05,968 INFO L350 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 3232 treesize of output 2712 [2022-12-14 03:19:06,852 INFO L350 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 952 treesize of output 692 [2022-12-14 03:21:12,122 WARN L233 SmtUtils]: Spent 2.08m on a formula simplification that was a NOOP. DAG size: 150 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-14 03:21:12,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:21:12,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1898 treesize of output 3342