./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:06:57,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:06:57,462 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 03:06:57,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:06:57,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:06:57,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:06:57,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:06:57,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:06:57,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:06:57,498 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:06:57,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:06:57,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:06:57,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:06:57,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:06:57,501 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:06:57,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:06:57,502 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:06:57,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:06:57,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:06:57,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:06:57,504 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:06:57,505 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:06:57,505 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:06:57,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:06:57,506 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:06:57,507 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:06:57,507 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:06:57,508 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:06:57,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:06:57,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:06:57,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:06:57,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:06:57,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:06:57,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:06:57,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:06:57,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:06:57,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:06:57,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:06:57,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:06:57,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:06:57,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:06:57,513 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/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_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2023-11-29 03:06:57,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:06:57,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:06:57,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:06:57,774 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:06:57,775 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:06:57,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2023-11-29 03:07:00,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:07:00,779 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:07:00,779 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2023-11-29 03:07:00,791 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/data/60dca12d8/c9bd6b3f96504a37b6127bfd22d400c0/FLAGa9a2f3c17 [2023-11-29 03:07:00,803 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/data/60dca12d8/c9bd6b3f96504a37b6127bfd22d400c0 [2023-11-29 03:07:00,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:07:00,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:07:00,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:07:00,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:07:00,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:07:00,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:07:00" (1/1) ... [2023-11-29 03:07:00,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696fc10f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:00, skipping insertion in model container [2023-11-29 03:07:00,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:07:00" (1/1) ... [2023-11-29 03:07:00,859 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:07:01,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:07:01,119 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:07:01,161 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:07:01,187 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:07:01,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01 WrapperNode [2023-11-29 03:07:01,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:07:01,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:07:01,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:07:01,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:07:01,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01" (1/1) ... [2023-11-29 03:07:01,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01" (1/1) ... [2023-11-29 03:07:01,235 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 146 [2023-11-29 03:07:01,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:07:01,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:07:01,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:07:01,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:07:01,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01" (1/1) ... [2023-11-29 03:07:01,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01" (1/1) ... [2023-11-29 03:07:01,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01" (1/1) ... [2023-11-29 03:07:01,273 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 18, 9]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 15 writes are split as follows [0, 13, 2]. [2023-11-29 03:07:01,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01" (1/1) ... [2023-11-29 03:07:01,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01" (1/1) ... [2023-11-29 03:07:01,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01" (1/1) ... [2023-11-29 03:07:01,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01" (1/1) ... [2023-11-29 03:07:01,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01" (1/1) ... [2023-11-29 03:07:01,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01" (1/1) ... [2023-11-29 03:07:01,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:07:01,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:07:01,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:07:01,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:07:01,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01" (1/1) ... [2023-11-29 03:07:01,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:07:01,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:01,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:07:01,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:07:01,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 03:07:01,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 03:07:01,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 03:07:01,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:07:01,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:07:01,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:07:01,358 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 03:07:01,358 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 03:07:01,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:07:01,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:07:01,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:07:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:07:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:07:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:07:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:07:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:07:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:07:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:07:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 03:07:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 03:07:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 03:07:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:07:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:07:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:07:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:07:01,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:07:01,480 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:07:01,481 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:07:01,817 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:07:01,855 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:07:01,855 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 03:07:01,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:07:01 BoogieIcfgContainer [2023-11-29 03:07:01,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:07:01,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:07:01,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:07:01,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:07:01,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:07:00" (1/3) ... [2023-11-29 03:07:01,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6543c106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:07:01, skipping insertion in model container [2023-11-29 03:07:01,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:07:01" (2/3) ... [2023-11-29 03:07:01,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6543c106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:07:01, skipping insertion in model container [2023-11-29 03:07:01,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:07:01" (3/3) ... [2023-11-29 03:07:01,865 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2023-11-29 03:07:01,884 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:07:01,884 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-11-29 03:07:01,930 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:07:01,936 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4162a101, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:07:01,936 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2023-11-29 03:07:01,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 55 states have (on average 2.327272727272727) internal successors, (128), 115 states have internal predecessors, (128), 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) [2023-11-29 03:07:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 03:07:01,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:01,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:07:01,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:01,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash 234339174, now seen corresponding path program 1 times [2023-11-29 03:07:01,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:01,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310153955] [2023-11-29 03:07:01,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:01,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:07:02,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:02,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310153955] [2023-11-29 03:07:02,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310153955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:02,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:07:02,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:07:02,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861248613] [2023-11-29 03:07:02,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:02,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:07:02,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:07:02,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:07:02,231 INFO L87 Difference]: Start difference. First operand has 120 states, 55 states have (on average 2.327272727272727) internal successors, (128), 115 states have internal predecessors, (128), 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, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:07:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:02,374 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-11-29 03:07:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:07:02,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 03:07:02,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:02,383 INFO L225 Difference]: With dead ends: 116 [2023-11-29 03:07:02,383 INFO L226 Difference]: Without dead ends: 114 [2023-11-29 03:07:02,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:07:02,388 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 8 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 164 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.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:02,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 164 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:07:02,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-29 03:07:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-11-29 03:07:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 53 states have (on average 2.188679245283019) internal successors, (116), 109 states have internal predecessors, (116), 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) [2023-11-29 03:07:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2023-11-29 03:07:02,424 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 5 [2023-11-29 03:07:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:02,424 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2023-11-29 03:07:02,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:07:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2023-11-29 03:07:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 03:07:02,425 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:02,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:07:02,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:07:02,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:02,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:02,427 INFO L85 PathProgramCache]: Analyzing trace with hash 234339175, now seen corresponding path program 1 times [2023-11-29 03:07:02,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:02,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875243212] [2023-11-29 03:07:02,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:02,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:07:02,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:02,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875243212] [2023-11-29 03:07:02,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875243212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:02,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:07:02,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:07:02,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330124684] [2023-11-29 03:07:02,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:02,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:07:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:02,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:07:02,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:07:02,573 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:07:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:02,689 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2023-11-29 03:07:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:07:02,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 03:07:02,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:02,691 INFO L225 Difference]: With dead ends: 111 [2023-11-29 03:07:02,691 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 03:07:02,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:07:02,693 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:02,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 169 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:07:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 03:07:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 03:07:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 106 states have internal predecessors, (113), 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) [2023-11-29 03:07:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2023-11-29 03:07:02,705 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 5 [2023-11-29 03:07:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:02,706 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2023-11-29 03:07:02,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:07:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2023-11-29 03:07:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 03:07:02,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:02,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:02,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:07:02,707 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:02,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:02,708 INFO L85 PathProgramCache]: Analyzing trace with hash -596233681, now seen corresponding path program 1 times [2023-11-29 03:07:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:02,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007618187] [2023-11-29 03:07:02,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:02,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:07:02,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:02,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007618187] [2023-11-29 03:07:02,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007618187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:02,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:07:02,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:07:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957448812] [2023-11-29 03:07:02,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:02,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:07:02,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:02,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:07:02,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:07:02,930 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:07:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:03,227 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2023-11-29 03:07:03,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:07:03,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-29 03:07:03,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:03,232 INFO L225 Difference]: With dead ends: 115 [2023-11-29 03:07:03,232 INFO L226 Difference]: Without dead ends: 115 [2023-11-29 03:07:03,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:07:03,234 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 7 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:03,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 350 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:07:03,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-29 03:07:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2023-11-29 03:07:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 55 states have (on average 2.1272727272727274) internal successors, (117), 108 states have internal predecessors, (117), 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) [2023-11-29 03:07:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2023-11-29 03:07:03,246 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 11 [2023-11-29 03:07:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:03,246 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2023-11-29 03:07:03,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:07:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2023-11-29 03:07:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 03:07:03,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:03,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:03,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:07:03,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:03,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:03,248 INFO L85 PathProgramCache]: Analyzing trace with hash -596233680, now seen corresponding path program 1 times [2023-11-29 03:07:03,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:03,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219189556] [2023-11-29 03:07:03,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:03,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:03,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:07:03,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:03,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219189556] [2023-11-29 03:07:03,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219189556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:03,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:07:03,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:07:03,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454129648] [2023-11-29 03:07:03,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:03,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:07:03,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:03,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:07:03,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:07:03,345 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:07:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:03,487 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2023-11-29 03:07:03,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:07:03,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-29 03:07:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:03,489 INFO L225 Difference]: With dead ends: 112 [2023-11-29 03:07:03,489 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 03:07:03,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:07:03,491 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 10 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:03,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 231 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:07:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 03:07:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-29 03:07:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 54 states have (on average 2.111111111111111) internal successors, (114), 107 states have internal predecessors, (114), 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) [2023-11-29 03:07:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2023-11-29 03:07:03,512 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 11 [2023-11-29 03:07:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:03,512 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2023-11-29 03:07:03,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:07:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2023-11-29 03:07:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:07:03,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:03,514 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:03,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:07:03,514 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:03,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1003078540, now seen corresponding path program 1 times [2023-11-29 03:07:03,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:03,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571145026] [2023-11-29 03:07:03,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:03,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:03,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:03,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:07:03,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571145026] [2023-11-29 03:07:03,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571145026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:03,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:07:03,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:07:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807967239] [2023-11-29 03:07:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:03,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:07:03,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:07:03,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:07:03,693 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:07:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:03,951 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2023-11-29 03:07:03,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:07:03,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-29 03:07:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:03,952 INFO L225 Difference]: With dead ends: 111 [2023-11-29 03:07:03,953 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 03:07:03,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:07:03,954 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 9 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:03,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 344 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:07:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 03:07:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 03:07:03,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 106 states have internal predecessors, (113), 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) [2023-11-29 03:07:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2023-11-29 03:07:03,962 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 19 [2023-11-29 03:07:03,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:03,963 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2023-11-29 03:07:03,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:07:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2023-11-29 03:07:03,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:07:03,964 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:03,964 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:03,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:07:03,964 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:03,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:03,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1003078539, now seen corresponding path program 1 times [2023-11-29 03:07:03,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:03,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094286979] [2023-11-29 03:07:03,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:03,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:04,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:04,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:07:04,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:04,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094286979] [2023-11-29 03:07:04,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094286979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:04,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:07:04,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:07:04,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416971688] [2023-11-29 03:07:04,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:04,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:07:04,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:04,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:07:04,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:07:04,254 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:07:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:04,505 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2023-11-29 03:07:04,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:07:04,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-29 03:07:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:04,507 INFO L225 Difference]: With dead ends: 110 [2023-11-29 03:07:04,507 INFO L226 Difference]: Without dead ends: 110 [2023-11-29 03:07:04,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:07:04,508 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 7 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:04,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 368 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:07:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-29 03:07:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-29 03:07:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 54 states have (on average 2.074074074074074) internal successors, (112), 105 states have internal predecessors, (112), 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) [2023-11-29 03:07:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2023-11-29 03:07:04,516 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2023-11-29 03:07:04,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:04,517 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2023-11-29 03:07:04,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:07:04,517 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2023-11-29 03:07:04,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:07:04,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:04,518 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:04,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:07:04,518 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:04,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:04,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1885802923, now seen corresponding path program 1 times [2023-11-29 03:07:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:04,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174923365] [2023-11-29 03:07:04,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:04,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:04,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:04,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:07:04,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:04,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174923365] [2023-11-29 03:07:04,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174923365] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:04,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232800407] [2023-11-29 03:07:04,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:04,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:04,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:04,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:04,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:07:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:04,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 03:07:04,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:05,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:07:05,075 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-29 03:07:05,137 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 03:07:05,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 03:07:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-29 03:07:05,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:07:05,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232800407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:05,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:07:05,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-11-29 03:07:05,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996020897] [2023-11-29 03:07:05,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:07:05,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:07:05,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:05,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:07:05,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-11-29 03:07:05,211 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:07:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:05,548 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2023-11-29 03:07:05,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:07:05,548 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2023-11-29 03:07:05,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:05,549 INFO L225 Difference]: With dead ends: 117 [2023-11-29 03:07:05,549 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 03:07:05,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-11-29 03:07:05,551 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 5 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:05,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 351 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 347 Invalid, 0 Unknown, 122 Unchecked, 0.3s Time] [2023-11-29 03:07:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 03:07:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-11-29 03:07:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 2.0344827586206895) internal successors, (118), 109 states have internal predecessors, (118), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:07:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2023-11-29 03:07:05,558 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 21 [2023-11-29 03:07:05,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:05,558 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2023-11-29 03:07:05,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:07:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2023-11-29 03:07:05,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:07:05,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:05,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:05,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:07:05,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-29 03:07:05,766 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:05,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:05,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1885802922, now seen corresponding path program 1 times [2023-11-29 03:07:05,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:05,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126633324] [2023-11-29 03:07:05,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:05,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:06,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:07:06,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:06,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126633324] [2023-11-29 03:07:06,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126633324] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:06,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132393533] [2023-11-29 03:07:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:06,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:06,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:06,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:06,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:07:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:06,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 03:07:06,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:06,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:07:06,517 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:07:06,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 03:07:06,535 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:07:06,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 03:07:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:07:06,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:07:06,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132393533] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:06,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:07:06,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-11-29 03:07:06,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917812345] [2023-11-29 03:07:06,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:07:06,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 03:07:06,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:06,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 03:07:06,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2023-11-29 03:07:06,757 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 18 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:07:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:07,465 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2023-11-29 03:07:07,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:07:07,467 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2023-11-29 03:07:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:07,469 INFO L225 Difference]: With dead ends: 117 [2023-11-29 03:07:07,469 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 03:07:07,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2023-11-29 03:07:07,470 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:07,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 699 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:07:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 03:07:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-11-29 03:07:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 109 states have internal predecessors, (117), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:07:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2023-11-29 03:07:07,476 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 21 [2023-11-29 03:07:07,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:07,477 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2023-11-29 03:07:07,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:07:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2023-11-29 03:07:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 03:07:07,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:07,478 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:07,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:07:07,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:07,683 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:07,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash 219744043, now seen corresponding path program 1 times [2023-11-29 03:07:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997643476] [2023-11-29 03:07:07,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:07,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:07,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:07,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:07:07,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:07,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997643476] [2023-11-29 03:07:07,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997643476] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:07,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955379598] [2023-11-29 03:07:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:07,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:07,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:07,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:07,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:07:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:07,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 03:07:07,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:07:08,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:07:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:07:08,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955379598] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:07:08,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:07:08,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-11-29 03:07:08,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536959011] [2023-11-29 03:07:08,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:07:08,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:07:08,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:08,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:07:08,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:07:08,062 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:07:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:08,221 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-11-29 03:07:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:07:08,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-11-29 03:07:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:08,222 INFO L225 Difference]: With dead ends: 116 [2023-11-29 03:07:08,222 INFO L226 Difference]: Without dead ends: 116 [2023-11-29 03:07:08,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:07:08,223 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:08,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 515 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:07:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-29 03:07:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2023-11-29 03:07:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 2.0) internal successors, (116), 109 states have internal predecessors, (116), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:07:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2023-11-29 03:07:08,242 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 23 [2023-11-29 03:07:08,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:08,243 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2023-11-29 03:07:08,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:07:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2023-11-29 03:07:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 03:07:08,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:08,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:08,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 03:07:08,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:08,447 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:08,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:08,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1782649922, now seen corresponding path program 1 times [2023-11-29 03:07:08,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:08,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775341820] [2023-11-29 03:07:08,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:08,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:08,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 03:07:08,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:08,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775341820] [2023-11-29 03:07:08,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775341820] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:08,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579599726] [2023-11-29 03:07:08,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:08,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:08,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:08,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:08,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:07:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:08,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 03:07:08,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 03:07:08,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:07:08,729 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 03:07:08,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2023-11-29 03:07:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 03:07:08,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579599726] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:07:08,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:07:08,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-11-29 03:07:08,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272277770] [2023-11-29 03:07:08,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:07:08,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:07:08,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:08,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:07:08,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:07:08,750 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:07:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:08,980 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2023-11-29 03:07:08,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:07:08,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-29 03:07:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:08,982 INFO L225 Difference]: With dead ends: 120 [2023-11-29 03:07:08,982 INFO L226 Difference]: Without dead ends: 120 [2023-11-29 03:07:08,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:07:08,983 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:08,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 340 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:07:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-29 03:07:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2023-11-29 03:07:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 112 states have internal predecessors, (121), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:07:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2023-11-29 03:07:08,988 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 24 [2023-11-29 03:07:08,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:08,988 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2023-11-29 03:07:08,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:07:08,988 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2023-11-29 03:07:08,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 03:07:08,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:08,989 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:08,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 03:07:09,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 03:07:09,191 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:09,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1782649921, now seen corresponding path program 1 times [2023-11-29 03:07:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:09,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374793181] [2023-11-29 03:07:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:09,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:09,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:09,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:07:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:09,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374793181] [2023-11-29 03:07:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374793181] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:09,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788370938] [2023-11-29 03:07:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:09,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:09,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:09,432 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:09,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:07:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:09,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:07:09,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:07:09,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:07:09,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:07:09,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 03:07:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:07:09,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788370938] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:07:09,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:07:09,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-11-29 03:07:09,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581943015] [2023-11-29 03:07:09,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:07:09,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 03:07:09,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:09,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 03:07:09,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:07:09,908 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 03:07:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:10,293 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2023-11-29 03:07:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:07:10,295 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 24 [2023-11-29 03:07:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:10,296 INFO L225 Difference]: With dead ends: 122 [2023-11-29 03:07:10,296 INFO L226 Difference]: Without dead ends: 122 [2023-11-29 03:07:10,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:07:10,297 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 12 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:10,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1039 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:07:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-29 03:07:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2023-11-29 03:07:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 61 states have (on average 1.9672131147540983) internal successors, (120), 112 states have internal predecessors, (120), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:07:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2023-11-29 03:07:10,302 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 24 [2023-11-29 03:07:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:10,302 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2023-11-29 03:07:10,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 03:07:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2023-11-29 03:07:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:07:10,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:10,303 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:10,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:07:10,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 03:07:10,507 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:10,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash 572427271, now seen corresponding path program 1 times [2023-11-29 03:07:10,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:10,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051234667] [2023-11-29 03:07:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:10,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:10,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:07:10,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:10,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051234667] [2023-11-29 03:07:10,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051234667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:10,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:07:10,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:07:10,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018583142] [2023-11-29 03:07:10,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:10,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:07:10,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:10,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:07:10,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:07:10,657 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:07:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:10,942 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2023-11-29 03:07:10,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:07:10,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-29 03:07:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:10,944 INFO L225 Difference]: With dead ends: 118 [2023-11-29 03:07:10,944 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 03:07:10,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:07:10,945 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 9 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:10,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 392 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:07:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 03:07:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2023-11-29 03:07:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 111 states have internal predecessors, (119), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:07:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2023-11-29 03:07:10,950 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 25 [2023-11-29 03:07:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:10,950 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2023-11-29 03:07:10,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:07:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2023-11-29 03:07:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:07:10,951 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:10,951 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:10,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 03:07:10,951 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:10,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash 572427272, now seen corresponding path program 1 times [2023-11-29 03:07:10,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:10,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135328536] [2023-11-29 03:07:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:11,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:11,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:07:11,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:11,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135328536] [2023-11-29 03:07:11,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135328536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:11,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:07:11,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:07:11,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935487030] [2023-11-29 03:07:11,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:11,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:07:11,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:11,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:07:11,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:07:11,219 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:07:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:11,496 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2023-11-29 03:07:11,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:07:11,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-29 03:07:11,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:11,497 INFO L225 Difference]: With dead ends: 116 [2023-11-29 03:07:11,497 INFO L226 Difference]: Without dead ends: 116 [2023-11-29 03:07:11,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:07:11,500 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:11,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 422 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:07:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-29 03:07:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-11-29 03:07:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 61 states have (on average 1.9344262295081966) internal successors, (118), 110 states have internal predecessors, (118), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:07:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2023-11-29 03:07:11,504 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 25 [2023-11-29 03:07:11,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:11,504 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2023-11-29 03:07:11,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:07:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2023-11-29 03:07:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 03:07:11,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:11,506 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:11,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 03:07:11,506 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:11,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:11,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1960500334, now seen corresponding path program 1 times [2023-11-29 03:07:11,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:11,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496201051] [2023-11-29 03:07:11,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:11,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:11,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:11,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:11,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:07:11,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:11,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496201051] [2023-11-29 03:07:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496201051] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:11,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536725932] [2023-11-29 03:07:11,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:11,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:11,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:11,944 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:11,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:07:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:12,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 03:07:12,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:12,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:07:12,228 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 03:07:12,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 03:07:12,317 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:07:12,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 03:07:12,379 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-29 03:07:12,398 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 03:07:12,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 03:07:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 10 not checked. [2023-11-29 03:07:12,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:07:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 03:07:12,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536725932] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:07:12,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:07:12,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 7] total 22 [2023-11-29 03:07:12,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211388696] [2023-11-29 03:07:12,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:07:12,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 03:07:12,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:12,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 03:07:12,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=410, Unknown=1, NotChecked=42, Total=552 [2023-11-29 03:07:12,879 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 24 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 03:07:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:13,334 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2023-11-29 03:07:13,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:07:13,335 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) Word has length 34 [2023-11-29 03:07:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:13,336 INFO L225 Difference]: With dead ends: 125 [2023-11-29 03:07:13,336 INFO L226 Difference]: Without dead ends: 125 [2023-11-29 03:07:13,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=563, Unknown=1, NotChecked=50, Total=756 [2023-11-29 03:07:13,338 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 371 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:13,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 335 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 516 Invalid, 0 Unknown, 120 Unchecked, 0.4s Time] [2023-11-29 03:07:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-29 03:07:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2023-11-29 03:07:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 61 states have (on average 1.8032786885245902) internal successors, (110), 102 states have internal predecessors, (110), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:07:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2023-11-29 03:07:13,343 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 34 [2023-11-29 03:07:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:13,344 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2023-11-29 03:07:13,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 03:07:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2023-11-29 03:07:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 03:07:13,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:13,345 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:13,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 03:07:13,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 03:07:13,546 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:13,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1960500333, now seen corresponding path program 1 times [2023-11-29 03:07:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:13,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98733282] [2023-11-29 03:07:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:14,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:14,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:14,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:07:14,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:14,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98733282] [2023-11-29 03:07:14,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98733282] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:14,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060702535] [2023-11-29 03:07:14,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:14,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:14,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:14,394 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:14,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 03:07:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:14,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 03:07:14,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:14,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:07:14,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 03:07:14,663 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-29 03:07:14,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:07:14,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:07:14,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 03:07:14,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:07:14,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:07:14,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 03:07:14,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:07:14,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:07:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 03:07:14,893 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:07:14,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060702535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:14,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:07:14,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2023-11-29 03:07:14,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347401912] [2023-11-29 03:07:14,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:14,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:07:14,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:14,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:07:14,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2023-11-29 03:07:14,895 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-11-29 03:07:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:15,040 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2023-11-29 03:07:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:07:15,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 34 [2023-11-29 03:07:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:15,041 INFO L225 Difference]: With dead ends: 103 [2023-11-29 03:07:15,041 INFO L226 Difference]: Without dead ends: 103 [2023-11-29 03:07:15,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2023-11-29 03:07:15,042 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 34 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:15,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 202 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 128 Unchecked, 0.1s Time] [2023-11-29 03:07:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-29 03:07:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-29 03:07:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.721311475409836) internal successors, (105), 97 states have internal predecessors, (105), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:07:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2023-11-29 03:07:15,047 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 34 [2023-11-29 03:07:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:15,047 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2023-11-29 03:07:15,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-11-29 03:07:15,047 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2023-11-29 03:07:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 03:07:15,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:15,048 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:15,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 03:07:15,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 03:07:15,249 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:15,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:15,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1077001948, now seen corresponding path program 1 times [2023-11-29 03:07:15,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:15,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859801595] [2023-11-29 03:07:15,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:15,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:15,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:15,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:15,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 03:07:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 03:07:15,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:15,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859801595] [2023-11-29 03:07:15,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859801595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:15,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:07:15,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:07:15,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410805996] [2023-11-29 03:07:15,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:15,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:07:15,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:15,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:07:15,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:07:15,375 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2023-11-29 03:07:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:15,475 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2023-11-29 03:07:15,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:07:15,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 34 [2023-11-29 03:07:15,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:15,477 INFO L225 Difference]: With dead ends: 91 [2023-11-29 03:07:15,477 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 03:07:15,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:07:15,478 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:15,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 193 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:07:15,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 03:07:15,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-29 03:07:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 86 states have internal predecessors, (91), 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) [2023-11-29 03:07:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2023-11-29 03:07:15,481 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 34 [2023-11-29 03:07:15,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:15,482 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2023-11-29 03:07:15,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2023-11-29 03:07:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2023-11-29 03:07:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 03:07:15,483 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:15,483 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 03:07:15,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 03:07:15,483 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:15,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:15,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1994826019, now seen corresponding path program 1 times [2023-11-29 03:07:15,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:15,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895919287] [2023-11-29 03:07:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:15,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:15,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:15,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:15,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 03:07:15,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895919287] [2023-11-29 03:07:15,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895919287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:15,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:07:15,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:07:15,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109920125] [2023-11-29 03:07:15,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:15,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:07:15,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:15,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:07:15,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:07:15,680 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:07:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:15,866 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2023-11-29 03:07:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:07:15,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2023-11-29 03:07:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:15,868 INFO L225 Difference]: With dead ends: 87 [2023-11-29 03:07:15,868 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 03:07:15,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:07:15,869 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 23 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:15,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 256 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:07:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 03:07:15,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-29 03:07:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 82 states have internal predecessors, (87), 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) [2023-11-29 03:07:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2023-11-29 03:07:15,872 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 37 [2023-11-29 03:07:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:15,873 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2023-11-29 03:07:15,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:07:15,873 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2023-11-29 03:07:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 03:07:15,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:15,874 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 03:07:15,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 03:07:15,874 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:15,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:15,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1994826020, now seen corresponding path program 1 times [2023-11-29 03:07:15,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:15,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654170025] [2023-11-29 03:07:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:16,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:16,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:16,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:07:16,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:16,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654170025] [2023-11-29 03:07:16,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654170025] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:16,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298455327] [2023-11-29 03:07:16,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:16,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:16,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:16,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:16,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 03:07:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:16,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 03:07:16,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:16,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:07:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 03:07:16,485 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:07:16,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298455327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:16,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:07:16,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-11-29 03:07:16,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405389005] [2023-11-29 03:07:16,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:16,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:07:16,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:16,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:07:16,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:07:16,487 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:07:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:16,629 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2023-11-29 03:07:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:07:16,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2023-11-29 03:07:16,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:16,631 INFO L225 Difference]: With dead ends: 83 [2023-11-29 03:07:16,631 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 03:07:16,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:07:16,632 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 18 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:16,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 239 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:07:16,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 03:07:16,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-29 03:07:16,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 states have internal predecessors, (83), 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) [2023-11-29 03:07:16,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2023-11-29 03:07:16,635 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 37 [2023-11-29 03:07:16,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:16,636 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2023-11-29 03:07:16,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:07:16,636 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2023-11-29 03:07:16,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 03:07:16,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:16,637 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 03:07:16,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 03:07:16,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 03:07:16,843 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:16,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:16,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1994836942, now seen corresponding path program 1 times [2023-11-29 03:07:16,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:16,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000798412] [2023-11-29 03:07:16,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:16,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:17,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:17,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:17,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:07:17,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:17,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000798412] [2023-11-29 03:07:17,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000798412] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:17,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427429263] [2023-11-29 03:07:17,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:17,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:17,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:17,256 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:17,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 03:07:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:17,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 03:07:17,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:17,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:07:17,666 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-29 03:07:17,690 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-29 03:07:17,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 03:07:17,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 03:07:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 03:07:17,735 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:07:17,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427429263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:17,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:07:17,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2023-11-29 03:07:17,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096611116] [2023-11-29 03:07:17,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:17,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:07:17,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:17,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:07:17,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=233, Unknown=1, NotChecked=30, Total=306 [2023-11-29 03:07:17,737 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:07:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:17,909 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2023-11-29 03:07:17,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:07:17,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2023-11-29 03:07:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:17,911 INFO L225 Difference]: With dead ends: 82 [2023-11-29 03:07:17,911 INFO L226 Difference]: Without dead ends: 82 [2023-11-29 03:07:17,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2023-11-29 03:07:17,912 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:17,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 270 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 126 Unchecked, 0.1s Time] [2023-11-29 03:07:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-29 03:07:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-29 03:07:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 77 states have internal predecessors, (82), 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) [2023-11-29 03:07:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-11-29 03:07:17,915 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 37 [2023-11-29 03:07:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:17,915 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-11-29 03:07:17,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:07:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-11-29 03:07:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 03:07:17,916 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:17,916 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 03:07:17,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 03:07:18,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:18,117 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:18,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1994836943, now seen corresponding path program 1 times [2023-11-29 03:07:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:18,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625649951] [2023-11-29 03:07:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:18,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:18,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:18,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:07:18,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:18,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625649951] [2023-11-29 03:07:18,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625649951] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:18,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334696838] [2023-11-29 03:07:18,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:18,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:18,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:18,748 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:18,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 03:07:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:19,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-29 03:07:19,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:19,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:07:19,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:07:19,387 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 03:07:19,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:07:19,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 03:07:19,444 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 03:07:19,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 03:07:19,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 03:07:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-11-29 03:07:19,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:07:19,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334696838] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:19,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:07:19,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-11-29 03:07:19,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766152182] [2023-11-29 03:07:19,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:07:19,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 03:07:19,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:19,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 03:07:19,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=681, Unknown=1, NotChecked=52, Total=812 [2023-11-29 03:07:19,716 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 26 states, 20 states have (on average 2.9) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:07:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:20,437 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2023-11-29 03:07:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:07:20,437 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 2.9) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2023-11-29 03:07:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:20,438 INFO L225 Difference]: With dead ends: 87 [2023-11-29 03:07:20,438 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 03:07:20,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=1323, Unknown=1, NotChecked=74, Total=1560 [2023-11-29 03:07:20,440 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 76 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:20,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 641 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 795 Invalid, 0 Unknown, 87 Unchecked, 0.4s Time] [2023-11-29 03:07:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 03:07:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-29 03:07:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:07:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2023-11-29 03:07:20,443 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 37 [2023-11-29 03:07:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:20,444 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2023-11-29 03:07:20,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 2.9) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:07:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2023-11-29 03:07:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 03:07:20,444 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:20,445 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 03:07:20,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 03:07:20,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:20,651 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:20,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1600516840, now seen corresponding path program 1 times [2023-11-29 03:07:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567654171] [2023-11-29 03:07:20,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:20,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:20,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:20,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:07:20,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:20,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567654171] [2023-11-29 03:07:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567654171] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:20,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504929360] [2023-11-29 03:07:20,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:20,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:20,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:20,968 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:20,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 03:07:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:21,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 03:07:21,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:21,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:07:21,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:07:21,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 03:07:21,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 03:07:21,331 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:07:21,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 03:07:21,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:07:21,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:07:21,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 03:07:21,520 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:07:21,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 03:07:21,542 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 03:07:21,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 03:07:21,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 03:07:21,669 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-29 03:07:21,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:07:21,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:07:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2023-11-29 03:07:21,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:07:21,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504929360] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:21,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:07:21,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 24 [2023-11-29 03:07:21,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878855651] [2023-11-29 03:07:21,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:07:21,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 03:07:21,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:21,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 03:07:21,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=521, Unknown=1, NotChecked=46, Total=650 [2023-11-29 03:07:21,886 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 24 states, 20 states have (on average 3.15) internal successors, (63), 18 states have internal predecessors, (63), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 03:07:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:22,582 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2023-11-29 03:07:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:07:22,583 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.15) internal successors, (63), 18 states have internal predecessors, (63), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2023-11-29 03:07:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:22,584 INFO L225 Difference]: With dead ends: 98 [2023-11-29 03:07:22,584 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 03:07:22,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=850, Unknown=1, NotChecked=60, Total=1056 [2023-11-29 03:07:22,585 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 275 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:22,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 364 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 790 Invalid, 0 Unknown, 93 Unchecked, 0.5s Time] [2023-11-29 03:07:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 03:07:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2023-11-29 03:07:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 75 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:07:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2023-11-29 03:07:22,590 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 40 [2023-11-29 03:07:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:22,590 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2023-11-29 03:07:22,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 3.15) internal successors, (63), 18 states have internal predecessors, (63), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 03:07:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2023-11-29 03:07:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 03:07:22,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:22,591 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 03:07:22,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 03:07:22,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:22,791 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:22,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash -726605321, now seen corresponding path program 1 times [2023-11-29 03:07:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:22,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104261920] [2023-11-29 03:07:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:22,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:22,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:22,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 03:07:22,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:22,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104261920] [2023-11-29 03:07:22,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104261920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:22,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:07:22,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:07:22,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988039127] [2023-11-29 03:07:22,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:22,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:07:22,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:22,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:07:22,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:07:22,909 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2023-11-29 03:07:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:23,030 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2023-11-29 03:07:23,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:07:23,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 41 [2023-11-29 03:07:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:23,031 INFO L225 Difference]: With dead ends: 80 [2023-11-29 03:07:23,031 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 03:07:23,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:07:23,032 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:23,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 228 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:07:23,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 03:07:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-29 03:07:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:07:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2023-11-29 03:07:23,034 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 41 [2023-11-29 03:07:23,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:23,034 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2023-11-29 03:07:23,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2023-11-29 03:07:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2023-11-29 03:07:23,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 03:07:23,035 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:23,035 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 03:07:23,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 03:07:23,035 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:23,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:23,035 INFO L85 PathProgramCache]: Analyzing trace with hash -726605320, now seen corresponding path program 1 times [2023-11-29 03:07:23,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:23,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216086329] [2023-11-29 03:07:23,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:23,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:23,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:23,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:23,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:07:23,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:23,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216086329] [2023-11-29 03:07:23,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216086329] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:23,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852655811] [2023-11-29 03:07:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:23,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:23,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:23,378 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:23,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 03:07:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:23,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 03:07:23,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:23,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-29 03:07:23,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 03:07:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 03:07:23,678 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:07:23,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852655811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:23,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:07:23,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2023-11-29 03:07:23,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573042776] [2023-11-29 03:07:23,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:23,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:07:23,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:23,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:07:23,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:07:23,680 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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) [2023-11-29 03:07:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:23,775 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2023-11-29 03:07:23,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:07:23,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 41 [2023-11-29 03:07:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:23,776 INFO L225 Difference]: With dead ends: 79 [2023-11-29 03:07:23,776 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 03:07:23,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:07:23,777 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:23,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 208 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:07:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 03:07:23,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-29 03:07:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.375) internal successors, (77), 73 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:07:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2023-11-29 03:07:23,781 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 41 [2023-11-29 03:07:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:23,781 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2023-11-29 03:07:23,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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) [2023-11-29 03:07:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2023-11-29 03:07:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 03:07:23,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:23,782 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1] [2023-11-29 03:07:23,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-29 03:07:23,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:23,982 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:23,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:23,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1049928421, now seen corresponding path program 1 times [2023-11-29 03:07:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:23,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906912133] [2023-11-29 03:07:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:23,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:24,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:24,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:24,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:07:24,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:24,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906912133] [2023-11-29 03:07:24,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906912133] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:24,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673647983] [2023-11-29 03:07:24,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:24,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:24,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:24,867 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:24,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 03:07:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:25,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 03:07:25,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:25,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2023-11-29 03:07:25,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2023-11-29 03:07:25,353 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:07:25,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:07:25,558 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0))) is different from true [2023-11-29 03:07:25,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:07:25,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-29 03:07:25,603 INFO L349 Elim1Store]: treesize reduction 96, result has 30.9 percent of original size [2023-11-29 03:07:25,603 INFO L378 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 36 treesize of output 52 [2023-11-29 03:07:25,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-11-29 03:07:25,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 03:07:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-29 03:07:25,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:07:25,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673647983] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:25,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:07:25,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2023-11-29 03:07:25,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304929486] [2023-11-29 03:07:25,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:07:25,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 03:07:25,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:25,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 03:07:25,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=960, Unknown=1, NotChecked=62, Total=1122 [2023-11-29 03:07:25,888 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 31 states, 25 states have (on average 2.48) internal successors, (62), 27 states have internal predecessors, (62), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 03:07:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:26,717 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2023-11-29 03:07:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:07:26,717 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.48) internal successors, (62), 27 states have internal predecessors, (62), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2023-11-29 03:07:26,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:26,718 INFO L225 Difference]: With dead ends: 78 [2023-11-29 03:07:26,718 INFO L226 Difference]: Without dead ends: 78 [2023-11-29 03:07:26,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=223, Invalid=2036, Unknown=1, NotChecked=92, Total=2352 [2023-11-29 03:07:26,719 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 67 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:26,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 623 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 750 Invalid, 0 Unknown, 81 Unchecked, 0.5s Time] [2023-11-29 03:07:26,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-29 03:07:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-29 03:07:26,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:07:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2023-11-29 03:07:26,722 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 42 [2023-11-29 03:07:26,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:26,723 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2023-11-29 03:07:26,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 2.48) internal successors, (62), 27 states have internal predecessors, (62), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 03:07:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2023-11-29 03:07:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 03:07:26,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:26,723 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1] [2023-11-29 03:07:26,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 03:07:26,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:26,924 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:26,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:26,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1049928420, now seen corresponding path program 1 times [2023-11-29 03:07:26,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:26,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82511412] [2023-11-29 03:07:26,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:26,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:27,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:27,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:07:28,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:28,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82511412] [2023-11-29 03:07:28,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82511412] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:28,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293512585] [2023-11-29 03:07:28,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:28,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:28,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:28,229 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:28,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 03:07:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:28,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 102 conjunts are in the unsatisfiable core [2023-11-29 03:07:28,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:28,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:07:28,748 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:07:28,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 03:07:28,760 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:07:28,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 03:07:28,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-29 03:07:28,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2023-11-29 03:07:29,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 19 [2023-11-29 03:07:29,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2023-11-29 03:07:29,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:07:29,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 03:07:29,179 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 03:07:29,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:07:29,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 52 [2023-11-29 03:07:29,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:07:29,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 23 [2023-11-29 03:07:29,218 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-11-29 03:07:29,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-11-29 03:07:29,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 03:07:29,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2023-11-29 03:07:29,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 17 [2023-11-29 03:07:29,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-11-29 03:07:29,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 03:07:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 03:07:29,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:07:29,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293512585] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:29,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:07:29,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 39 [2023-11-29 03:07:29,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164680021] [2023-11-29 03:07:29,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:07:29,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-29 03:07:29,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:29,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-29 03:07:29,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1681, Unknown=1, NotChecked=82, Total=1892 [2023-11-29 03:07:29,763 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 40 states, 30 states have (on average 2.2) internal successors, (66), 33 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:07:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:30,914 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-11-29 03:07:30,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 03:07:30,914 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 30 states have (on average 2.2) internal successors, (66), 33 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2023-11-29 03:07:30,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:30,915 INFO L225 Difference]: With dead ends: 77 [2023-11-29 03:07:30,915 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 03:07:30,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=242, Invalid=2841, Unknown=1, NotChecked=108, Total=3192 [2023-11-29 03:07:30,917 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 74 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:30,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 913 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1062 Invalid, 0 Unknown, 75 Unchecked, 0.7s Time] [2023-11-29 03:07:30,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 03:07:30,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-29 03:07:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:07:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-11-29 03:07:30,920 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 42 [2023-11-29 03:07:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:30,920 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-11-29 03:07:30,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 30 states have (on average 2.2) internal successors, (66), 33 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 03:07:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-11-29 03:07:30,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 03:07:30,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:30,921 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2023-11-29 03:07:30,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 03:07:31,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 03:07:31,122 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:31,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 876997640, now seen corresponding path program 1 times [2023-11-29 03:07:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:31,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749757564] [2023-11-29 03:07:31,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:31,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:31,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:31,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 03:07:31,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:31,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749757564] [2023-11-29 03:07:31,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749757564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:31,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:07:31,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:07:31,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738341098] [2023-11-29 03:07:31,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:31,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:07:31,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:31,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:07:31,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:07:31,393 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 10 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:07:31,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:31,572 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2023-11-29 03:07:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:07:31,572 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2023-11-29 03:07:31,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:31,573 INFO L225 Difference]: With dead ends: 99 [2023-11-29 03:07:31,573 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 03:07:31,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:07:31,574 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 62 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:31,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 224 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:07:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 03:07:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2023-11-29 03:07:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:07:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2023-11-29 03:07:31,577 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 46 [2023-11-29 03:07:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:31,578 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2023-11-29 03:07:31,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:07:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2023-11-29 03:07:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 03:07:31,578 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:31,578 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2023-11-29 03:07:31,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 03:07:31,578 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:31,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:31,579 INFO L85 PathProgramCache]: Analyzing trace with hash 876997641, now seen corresponding path program 1 times [2023-11-29 03:07:31,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:31,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437404851] [2023-11-29 03:07:31,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:31,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:31,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:31,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:31,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 03:07:31,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:31,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437404851] [2023-11-29 03:07:31,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437404851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:31,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:07:31,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:07:31,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917201391] [2023-11-29 03:07:31,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:31,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:07:31,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:31,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:07:31,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:07:31,978 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 10 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:07:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:32,163 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2023-11-29 03:07:32,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:07:32,164 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2023-11-29 03:07:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:32,164 INFO L225 Difference]: With dead ends: 83 [2023-11-29 03:07:32,165 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 03:07:32,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:07:32,165 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 63 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:32,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 247 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:07:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 03:07:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2023-11-29 03:07:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:07:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-11-29 03:07:32,169 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 46 [2023-11-29 03:07:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:32,169 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-11-29 03:07:32,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:07:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-11-29 03:07:32,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 03:07:32,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:32,170 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:32,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 03:07:32,170 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:32,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:32,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2013066708, now seen corresponding path program 1 times [2023-11-29 03:07:32,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:32,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514456512] [2023-11-29 03:07:32,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:32,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:33,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:33,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:33,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:07:34,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:34,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514456512] [2023-11-29 03:07:34,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514456512] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:34,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870824128] [2023-11-29 03:07:34,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:34,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:34,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:34,022 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:34,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 03:07:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:34,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 105 conjunts are in the unsatisfiable core [2023-11-29 03:07:34,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:34,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2023-11-29 03:07:34,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2023-11-29 03:07:34,648 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:07:34,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:07:34,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:07:34,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:07:34,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-29 03:07:34,908 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2023-11-29 03:07:34,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 03:07:35,262 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:07:35,262 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:07:35,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 8 [2023-11-29 03:07:35,474 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 03:07:35,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 03:07:35,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 03:07:35,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:07:35,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:07:35,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:07:35,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-29 03:07:35,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 03:07:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:07:35,966 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:07:35,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870824128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:07:35,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:07:35,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [24] total 47 [2023-11-29 03:07:35,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269323501] [2023-11-29 03:07:35,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:35,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 03:07:35,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:35,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 03:07:35,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2007, Unknown=0, NotChecked=0, Total=2162 [2023-11-29 03:07:35,969 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 26 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:07:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:36,797 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2023-11-29 03:07:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 03:07:36,798 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2023-11-29 03:07:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:36,799 INFO L225 Difference]: With dead ends: 79 [2023-11-29 03:07:36,799 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 03:07:36,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2023-11-29 03:07:36,801 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 89 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:36,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 704 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:07:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 03:07:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-29 03:07:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.305084745762712) internal successors, (77), 73 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:07:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2023-11-29 03:07:36,804 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 50 [2023-11-29 03:07:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:36,804 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2023-11-29 03:07:36,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 03:07:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2023-11-29 03:07:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 03:07:36,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:36,805 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:36,810 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 03:07:37,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 03:07:37,005 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:07:37,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:37,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2022445768, now seen corresponding path program 1 times [2023-11-29 03:07:37,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:07:37,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418134765] [2023-11-29 03:07:37,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:37,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:07:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:38,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:07:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:38,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:07:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:38,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:07:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:07:38,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:07:38,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418134765] [2023-11-29 03:07:38,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418134765] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:38,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743276313] [2023-11-29 03:07:38,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:38,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:07:38,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:07:38,540 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:07:38,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 03:07:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:38,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 102 conjunts are in the unsatisfiable core [2023-11-29 03:07:38,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:39,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:07:39,215 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 03:07:39,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 03:07:39,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 03:07:39,538 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 03:07:39,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 03:07:39,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:07:39,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:07:39,747 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:07:39,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:07:39,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:07:39,878 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-29 03:07:39,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2023-11-29 03:07:39,917 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 03:07:39,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 03:07:40,092 INFO L349 Elim1Store]: treesize reduction 93, result has 35.4 percent of original size [2023-11-29 03:07:40,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 69 [2023-11-29 03:07:40,120 INFO L349 Elim1Store]: treesize reduction 121, result has 16.0 percent of original size [2023-11-29 03:07:40,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 97 [2023-11-29 03:07:40,678 INFO L349 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2023-11-29 03:07:40,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 125 [2023-11-29 03:07:40,697 INFO L349 Elim1Store]: treesize reduction 17, result has 48.5 percent of original size [2023-11-29 03:07:40,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 97 [2023-11-29 03:07:40,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2023-11-29 03:07:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:07:40,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:07:41,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:07:41,700 INFO L378 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 246 treesize of output 616 [2023-11-29 03:07:51,914 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse0 (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse10 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse10 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse0) (= .cse0 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse4 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse4 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse6 (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse8 v_prenex_5 (store (select .cse8 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse6) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse6) (= .cse0 v_prenex_5) (= .cse0 .cse6))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse11 (select (select (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse18 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse18 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse17 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse11) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse12 (select (select (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse14 v_prenex_5 (store (select .cse14 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse12) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse12) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse12) (= .cse11 v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (= .cse11 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse16 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse16 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse15 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse20 (select (select (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse24 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse24 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse23 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse23 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse19 (select (select (let ((.cse21 (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse22 v_prenex_5 (store (select .cse22 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse21 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse21 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse19) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse19) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse19) (= .cse20 .cse19)))) (= .cse20 v_prenex_5))) (= .cse20 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_prenex_6 (Array Int Int))) (let ((.cse25 (select (select (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse29 v_prenex_5 (store (select .cse29 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse28 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse28 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse25) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse25) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse25) (= (select (select (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse27 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse27 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse26 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse26 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1) .cse25)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse30 (select (select (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse37 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse37 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse36 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse36 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse30) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse31 (select (select (let ((.cse32 (let ((.cse33 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse33 v_prenex_5 (store (select .cse33 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse32 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse32 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse31) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse31) (= .cse30 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (= .cse30 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse34 (let ((.cse35 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse35 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse35 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse34 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse34 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse38 (select (select (let ((.cse42 (let ((.cse43 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse43 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse43 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse42 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse42 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse38) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse39 (select (select (let ((.cse40 (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse41 v_prenex_5 (store (select .cse41 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse40 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse40 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse39) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse39) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse39) (= .cse38 .cse39)))) (= .cse38 v_prenex_5))) (= .cse38 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (or (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse44 (select (select (let ((.cse47 (let ((.cse48 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse48 v_prenex_5 (store (select .cse48 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse47 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse47 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse44) (= .cse5 .cse44) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse44) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= (select (select (let ((.cse45 (let ((.cse46 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse46 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse46 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse45 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse45 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1) .cse44)))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse49 (select (select (let ((.cse53 (let ((.cse54 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse54 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse54 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse53 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse53 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse49) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse50 (select (select (let ((.cse51 (let ((.cse52 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse52 v_prenex_5 (store (select .cse52 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse51 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse51 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse50) (= .cse5 .cse50) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse50) (= .cse49 v_prenex_5) (= .cse49 .cse50))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse55 (select (select (let ((.cse61 (let ((.cse62 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse62 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse62 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse61 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse61 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse55) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse56 (select (select (let ((.cse57 (let ((.cse58 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse58 v_prenex_5 (store (select .cse58 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse57 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse57 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse56) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse56) (= .cse55 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= .cse55 .cse56)))) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse59 (let ((.cse60 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse60 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse60 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse59 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse59 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse63 (select (select (let ((.cse67 (let ((.cse68 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse68 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse68 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse67 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse67 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse63) (= .cse63 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse64 (select (select (let ((.cse65 (let ((.cse66 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse66 v_prenex_5 (store (select .cse66 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse65 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse65 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse64) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse64) (= .cse5 .cse64) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse64) (= .cse63 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse69 (select (select (let ((.cse75 (let ((.cse76 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse76 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse76 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse75 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse75 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse69) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse70 (select (select (let ((.cse71 (let ((.cse72 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse72 v_prenex_5 (store (select .cse72 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse71 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse71 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse70) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse70) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (= .cse69 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse73 (let ((.cse74 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse74 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse74 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse73 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse73 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse77 (select (select (let ((.cse83 (let ((.cse84 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse84 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse84 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse83 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse83 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse77) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse78 (select (select (let ((.cse79 (let ((.cse80 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse80 v_prenex_5 (store (select .cse80 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse79 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse79 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse78) (= .cse77 v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse77 .cse78)))) (= .cse77 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse81 (let ((.cse82 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse82 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse82 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse81 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse81 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int)) (or (forall ((v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse85 (select (select (let ((.cse89 (let ((.cse90 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse90 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse90 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse89 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse89 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse85) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse86 (select (select (let ((.cse87 (let ((.cse88 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse88 v_prenex_5 (store (select .cse88 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse87 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse87 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse86) (= .cse5 .cse86) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse86) (= .cse85 v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse91 (select (select (let ((.cse97 (let ((.cse98 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse98 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse98 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse97 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse97 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse91) (= .cse91 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse92 (let ((.cse93 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse93 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse93 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse92 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse92 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse94 (select (select (let ((.cse95 (let ((.cse96 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse96 v_prenex_5 (store (select .cse96 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse95 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse95 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse94) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse94) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse91 .cse94))))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (or (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse99 (select (select (let ((.cse102 (let ((.cse103 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse103 v_prenex_5 (store (select .cse103 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse102 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse102 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse99) (= .cse5 .cse99) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse99) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= (select (select (let ((.cse100 (let ((.cse101 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse101 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse101 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse100 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse100 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1) .cse99)))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse104 (select (select (let ((.cse109 (let ((.cse110 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse110 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse110 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse109 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse109 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse104) (= .cse104 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse105 (let ((.cse106 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse106 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse106 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse105 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse105 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (or (= .cse104 v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse104 (select (select (let ((.cse107 (let ((.cse108 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse108 v_prenex_5 (store (select .cse108 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse107 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse107 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_prenex_5 Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse112 (select (select (let ((.cse115 (let ((.cse116 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse116 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse116 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse115 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse115 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse111 (select (select (let ((.cse113 (let ((.cse114 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse114 v_prenex_5 (store (select .cse114 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse113 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse113 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse111) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse111) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse111) (= .cse112 .cse111)))) (= .cse112 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse117 (select (select (let ((.cse122 (let ((.cse123 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse123 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse123 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse122 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse122 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse117) (= .cse117 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse118 (let ((.cse119 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse119 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse119 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse118 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse118 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (or (= .cse117 v_prenex_5) (= .cse117 (select (select (let ((.cse120 (let ((.cse121 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse121 v_prenex_5 (store (select .cse121 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse120 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse120 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_prenex_6 (Array Int Int))) (let ((.cse124 (select (select (let ((.cse127 (let ((.cse128 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse128 v_prenex_5 (store (select .cse128 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse127 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse127 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse124) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse124) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse124) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= (select (select (let ((.cse125 (let ((.cse126 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse126 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse126 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse125 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse125 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1) .cse124)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse129 (select (select (let ((.cse133 (let ((.cse134 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse134 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse134 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse133 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse133 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse129) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse130 (select (select (let ((.cse131 (let ((.cse132 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse132 v_prenex_5 (store (select .cse132 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse131 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse131 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse130) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse130) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse130) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse129 .cse130))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse135 (select (select (let ((.cse141 (let ((.cse142 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse142 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse142 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse141 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse141 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse135) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse136 (select (select (let ((.cse137 (let ((.cse138 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse138 v_prenex_5 (store (select .cse138 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse137 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse137 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse136) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse136) (= .cse135 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (= .cse135 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse139 (let ((.cse140 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse140 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse140 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse139 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse139 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse143 (select (select (let ((.cse147 (let ((.cse148 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse148 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse148 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse147 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse147 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse143) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse144 (select (select (let ((.cse145 (let ((.cse146 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse146 v_prenex_5 (store (select .cse146 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse145 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse145 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse144) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse144) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse144) (= .cse143 .cse144))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse149 (select (select (let ((.cse153 (let ((.cse154 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse154 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse154 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse153 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse153 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse149) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse150 (select (select (let ((.cse151 (let ((.cse152 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse152 v_prenex_5 (store (select .cse152 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse151 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse151 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse150) (= .cse5 .cse150) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse150) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse149 .cse150)))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse155 (select (select (let ((.cse161 (let ((.cse162 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse162 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse162 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse161 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse161 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse155) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse156 (select (select (let ((.cse157 (let ((.cse158 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse158 v_prenex_5 (store (select .cse158 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse157 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse157 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse156) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse156) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= .cse155 .cse156)))) (= .cse155 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse159 (let ((.cse160 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse160 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse160 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse159 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse159 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse163 (select (select (let ((.cse167 (let ((.cse168 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse168 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse168 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse167 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse167 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse163) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse164 (select (select (let ((.cse165 (let ((.cse166 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse166 v_prenex_5 (store (select .cse166 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse165 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse165 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse164) (= .cse5 .cse164) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse164) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse163 .cse164)))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse169 (select (select (let ((.cse175 (let ((.cse176 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse176 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse176 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse175 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse175 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse169) (= .cse169 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse170 (let ((.cse171 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse171 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse171 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse170 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse170 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse172 (select (select (let ((.cse173 (let ((.cse174 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse174 v_prenex_5 (store (select .cse174 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse173 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse173 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse172) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse169 .cse172))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int)) (or (forall ((v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse177 (select (select (let ((.cse183 (let ((.cse184 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse184 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse184 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse183 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse183 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse177) (= .cse177 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse178 (let ((.cse179 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse179 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse179 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse178 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse178 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse180 (select (select (let ((.cse181 (let ((.cse182 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse182 v_prenex_5 (store (select .cse182 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse181 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse181 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse180) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse177 .cse180))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse186 (select (select (let ((.cse191 (let ((.cse192 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse192 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse192 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse191 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse191 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse185 (select (select (let ((.cse187 (let ((.cse188 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse188 v_prenex_5 (store (select .cse188 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse187 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse187 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse185) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse185) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse185) (= .cse186 v_prenex_5)))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse186) (= .cse186 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse189 (let ((.cse190 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse190 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse190 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse189 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse189 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse193 (select (select (let ((.cse199 (let ((.cse200 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse200 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse200 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse199 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse199 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse193) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse194 (select (select (let ((.cse195 (let ((.cse196 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse196 v_prenex_5 (store (select .cse196 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse195 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse195 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse194) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse194) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse193 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse197 (let ((.cse198 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse198 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse198 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse197 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse197 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse201 (select (select (let ((.cse205 (let ((.cse206 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse206 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse206 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse205 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse205 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse201) (= .cse201 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse202 (select (select (let ((.cse203 (let ((.cse204 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse204 v_prenex_5 (store (select .cse204 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse203 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse203 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse202) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse202) (= .cse5 .cse202) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse202) (= .cse201 v_prenex_5))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse207 (select (select (let ((.cse213 (let ((.cse214 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse214 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse214 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse213 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse213 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse207) (= .cse207 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse208 (let ((.cse209 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse209 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse209 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse208 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse208 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse210 (select (select (let ((.cse211 (let ((.cse212 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse212 v_prenex_5 (store (select .cse212 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse211 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse211 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse210) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse210) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse210) (= .cse207 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse216 (select (select (let ((.cse219 (let ((.cse220 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse220 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse220 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse219 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse219 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1)) (.cse215 (select (select (let ((.cse217 (let ((.cse218 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse218 v_prenex_5 (store (select .cse218 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse217 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse217 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse215) (= .cse5 .cse215) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse215) (= .cse216 v_prenex_5) (= .cse216 .cse215)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse221 (select (select (let ((.cse225 (let ((.cse226 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse226 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse226 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse225 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse225 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse221) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse222 (select (select (let ((.cse223 (let ((.cse224 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse224 v_prenex_5 (store (select .cse224 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse223 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse223 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse222) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse222) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse222) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= .cse221 .cse222))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse227 (select (select (let ((.cse233 (let ((.cse234 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse234 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse234 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse233 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse233 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse227) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse228 (select (select (let ((.cse229 (let ((.cse230 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse230 v_prenex_5 (store (select .cse230 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse229 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse229 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse228) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse228) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= .cse227 .cse228)))) (= .cse227 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse231 (let ((.cse232 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse232 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse232 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse231 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse231 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse236 (select (select (let ((.cse239 (let ((.cse240 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse240 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse240 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse239 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse239 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse235 (select (select (let ((.cse237 (let ((.cse238 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse238 v_prenex_5 (store (select .cse238 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse237 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse237 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse235) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse235) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse235) (= .cse236 .cse235)))) (= .cse236 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse236)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse241 (select (select (let ((.cse247 (let ((.cse248 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse248 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse248 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse247 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse247 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse241) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse242 (let ((.cse243 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse243 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse243 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse242 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse242 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse244 (select (select (let ((.cse245 (let ((.cse246 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse246 v_prenex_5 (store (select .cse246 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse245 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse245 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse244) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse244) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse241 .cse244))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_prenex_6 (Array Int Int))) (let ((.cse249 (select (select (let ((.cse252 (let ((.cse253 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse253 v_prenex_5 (store (select .cse253 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse252 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse252 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse249) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse249) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse249) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= (select (select (let ((.cse250 (let ((.cse251 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse251 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse251 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse250 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse250 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1) .cse249)))))) is different from false [2023-11-29 03:07:56,036 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse0 (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse10 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse10 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse0) (= .cse0 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse4 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse4 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse6 (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse8 v_prenex_5 (store (select .cse8 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse6) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse6) (= .cse0 v_prenex_5) (= .cse0 .cse6))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse11 (select (select (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse18 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse18 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse17 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse11) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse12 (select (select (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse14 v_prenex_5 (store (select .cse14 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse12) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse12) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse12) (= .cse11 v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (= .cse11 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse16 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse16 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse15 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse20 (select (select (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse24 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse24 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse23 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse23 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse19 (select (select (let ((.cse21 (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse22 v_prenex_5 (store (select .cse22 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse21 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse21 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse19) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse19) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse19) (= .cse20 .cse19)))) (= .cse20 v_prenex_5))) (= .cse20 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_prenex_6 (Array Int Int))) (let ((.cse25 (select (select (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse29 v_prenex_5 (store (select .cse29 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse28 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse28 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse25) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse25) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse25) (= (select (select (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse27 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse27 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse26 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse26 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1) .cse25)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse30 (select (select (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse37 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse37 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse36 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse36 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse30) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse31 (select (select (let ((.cse32 (let ((.cse33 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse33 v_prenex_5 (store (select .cse33 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse32 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse32 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse31) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse31) (= .cse30 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (= .cse30 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse34 (let ((.cse35 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse35 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse35 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse34 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse34 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse38 (select (select (let ((.cse42 (let ((.cse43 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse43 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse43 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse42 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse42 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse38) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse39 (select (select (let ((.cse40 (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse41 v_prenex_5 (store (select .cse41 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse40 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse40 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse39) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse39) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse39) (= .cse38 .cse39)))) (= .cse38 v_prenex_5))) (= .cse38 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (or (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse44 (select (select (let ((.cse47 (let ((.cse48 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse48 v_prenex_5 (store (select .cse48 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse47 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse47 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse44) (= .cse5 .cse44) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse44) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= (select (select (let ((.cse45 (let ((.cse46 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse46 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse46 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse45 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse45 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1) .cse44)))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse49 (select (select (let ((.cse53 (let ((.cse54 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse54 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse54 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse53 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse53 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse49) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse50 (select (select (let ((.cse51 (let ((.cse52 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse52 v_prenex_5 (store (select .cse52 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse51 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse51 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse50) (= .cse5 .cse50) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse50) (= .cse49 v_prenex_5) (= .cse49 .cse50))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse55 (select (select (let ((.cse61 (let ((.cse62 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse62 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse62 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse61 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse61 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse55) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse56 (select (select (let ((.cse57 (let ((.cse58 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse58 v_prenex_5 (store (select .cse58 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse57 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse57 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse56) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse56) (= .cse55 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= .cse55 .cse56)))) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse59 (let ((.cse60 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse60 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse60 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse59 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse59 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse63 (select (select (let ((.cse67 (let ((.cse68 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse68 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse68 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse67 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse67 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse63) (= .cse63 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse64 (select (select (let ((.cse65 (let ((.cse66 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse66 v_prenex_5 (store (select .cse66 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse65 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse65 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse64) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse64) (= .cse5 .cse64) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse64) (= .cse63 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse69 (select (select (let ((.cse75 (let ((.cse76 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse76 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse76 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse75 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse75 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse69) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse70 (select (select (let ((.cse71 (let ((.cse72 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse72 v_prenex_5 (store (select .cse72 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse71 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse71 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse70) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse70) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (= .cse69 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse73 (let ((.cse74 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse74 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse74 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse73 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse73 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse77 (select (select (let ((.cse83 (let ((.cse84 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse84 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse84 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse83 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse83 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse77) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse78 (select (select (let ((.cse79 (let ((.cse80 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse80 v_prenex_5 (store (select .cse80 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse79 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse79 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse78) (= .cse77 v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse77 .cse78)))) (= .cse77 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse81 (let ((.cse82 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse82 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse82 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse81 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse81 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int)) (or (forall ((v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse85 (select (select (let ((.cse89 (let ((.cse90 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse90 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse90 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse89 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse89 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse85) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse86 (select (select (let ((.cse87 (let ((.cse88 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse88 v_prenex_5 (store (select .cse88 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse87 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse87 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse86) (= .cse5 .cse86) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse86) (= .cse85 v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse91 (select (select (let ((.cse97 (let ((.cse98 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse98 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse98 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse97 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse97 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse91) (= .cse91 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse92 (let ((.cse93 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse93 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse93 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse92 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse92 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse94 (select (select (let ((.cse95 (let ((.cse96 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse96 v_prenex_5 (store (select .cse96 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse95 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse95 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse94) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse94) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse91 .cse94))))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (or (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse99 (select (select (let ((.cse102 (let ((.cse103 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse103 v_prenex_5 (store (select .cse103 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse102 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse102 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse99) (= .cse5 .cse99) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse99) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= (select (select (let ((.cse100 (let ((.cse101 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse101 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse101 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse100 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse100 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1) .cse99)))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse104 (select (select (let ((.cse109 (let ((.cse110 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse110 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse110 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse109 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse109 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse104) (= .cse104 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse105 (let ((.cse106 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse106 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse106 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse105 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse105 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (or (= .cse104 v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse104 (select (select (let ((.cse107 (let ((.cse108 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse108 v_prenex_5 (store (select .cse108 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse107 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse107 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_prenex_5 Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse112 (select (select (let ((.cse115 (let ((.cse116 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse116 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse116 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse115 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse115 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse111 (select (select (let ((.cse113 (let ((.cse114 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse114 v_prenex_5 (store (select .cse114 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse113 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse113 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse111) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse111) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse111) (= .cse112 .cse111)))) (= .cse112 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse117 (select (select (let ((.cse122 (let ((.cse123 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse123 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse123 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse122 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse122 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse117) (= .cse117 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse118 (let ((.cse119 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse119 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse119 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse118 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse118 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (or (= .cse117 v_prenex_5) (= .cse117 (select (select (let ((.cse120 (let ((.cse121 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse121 v_prenex_5 (store (select .cse121 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse120 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse120 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_prenex_6 (Array Int Int))) (let ((.cse124 (select (select (let ((.cse127 (let ((.cse128 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse128 v_prenex_5 (store (select .cse128 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse127 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse127 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse124) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse124) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse124) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= (select (select (let ((.cse125 (let ((.cse126 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse126 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse126 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse125 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse125 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1) .cse124)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse129 (select (select (let ((.cse133 (let ((.cse134 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse134 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse134 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse133 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse133 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse129) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse130 (select (select (let ((.cse131 (let ((.cse132 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse132 v_prenex_5 (store (select .cse132 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse131 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse131 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse130) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse130) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse130) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse129 .cse130))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse135 (select (select (let ((.cse141 (let ((.cse142 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse142 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse142 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse141 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse141 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse135) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse136 (select (select (let ((.cse137 (let ((.cse138 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse138 v_prenex_5 (store (select .cse138 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse137 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse137 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse136) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse136) (= .cse135 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (= .cse135 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse139 (let ((.cse140 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse140 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse140 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse139 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse139 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse143 (select (select (let ((.cse147 (let ((.cse148 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse148 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse148 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse147 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse147 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse143) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse144 (select (select (let ((.cse145 (let ((.cse146 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse146 v_prenex_5 (store (select .cse146 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse145 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse145 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse144) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse144) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse144) (= .cse143 .cse144))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse149 (select (select (let ((.cse153 (let ((.cse154 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse154 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse154 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse153 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse153 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse149) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse150 (select (select (let ((.cse151 (let ((.cse152 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse152 v_prenex_5 (store (select .cse152 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse151 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse151 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse150) (= .cse5 .cse150) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse150) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse149 .cse150)))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse155 (select (select (let ((.cse161 (let ((.cse162 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse162 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse162 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse161 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse161 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse155) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse156 (select (select (let ((.cse157 (let ((.cse158 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse158 v_prenex_5 (store (select .cse158 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse157 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse157 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse156) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse156) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= .cse155 .cse156)))) (= .cse155 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse159 (let ((.cse160 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse160 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse160 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse159 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse159 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse163 (select (select (let ((.cse167 (let ((.cse168 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse168 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse168 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse167 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse167 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse163) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse164 (select (select (let ((.cse165 (let ((.cse166 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse166 v_prenex_5 (store (select .cse166 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse165 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse165 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse164) (= .cse5 .cse164) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse164) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse163 .cse164)))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse169 (select (select (let ((.cse175 (let ((.cse176 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse176 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse176 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse175 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse175 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse169) (= .cse169 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse170 (let ((.cse171 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse171 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse171 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse170 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse170 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse172 (select (select (let ((.cse173 (let ((.cse174 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse174 v_prenex_5 (store (select .cse174 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse173 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse173 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse172) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse169 .cse172))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int)) (or (forall ((v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse177 (select (select (let ((.cse183 (let ((.cse184 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse184 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse184 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse183 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse183 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse177) (= .cse177 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse178 (let ((.cse179 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse179 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse179 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse178 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse178 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse180 (select (select (let ((.cse181 (let ((.cse182 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse182 v_prenex_5 (store (select .cse182 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse181 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse181 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse180) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse177 .cse180))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse186 (select (select (let ((.cse191 (let ((.cse192 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse192 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse192 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse191 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse191 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse185 (select (select (let ((.cse187 (let ((.cse188 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse188 v_prenex_5 (store (select .cse188 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse187 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse187 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse185) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse185) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse185) (= .cse186 v_prenex_5)))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse186) (= .cse186 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse189 (let ((.cse190 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse190 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse190 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse189 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse189 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse193 (select (select (let ((.cse199 (let ((.cse200 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse200 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse200 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse199 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse199 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse193) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse194 (select (select (let ((.cse195 (let ((.cse196 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse196 v_prenex_5 (store (select .cse196 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse195 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse195 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse194) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse194) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse193 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse197 (let ((.cse198 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse198 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse198 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse197 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse197 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse201 (select (select (let ((.cse205 (let ((.cse206 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse206 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse206 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse205 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse205 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse201) (= .cse201 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse202 (select (select (let ((.cse203 (let ((.cse204 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse204 v_prenex_5 (store (select .cse204 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse203 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse203 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse202) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse202) (= .cse5 .cse202) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse202) (= .cse201 v_prenex_5))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse207 (select (select (let ((.cse213 (let ((.cse214 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse214 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse214 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse213 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse213 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse207) (= .cse207 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse208 (let ((.cse209 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse209 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse209 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse208 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse208 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse210 (select (select (let ((.cse211 (let ((.cse212 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse212 v_prenex_5 (store (select .cse212 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse211 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse211 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse210) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse210) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse210) (= .cse207 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse216 (select (select (let ((.cse219 (let ((.cse220 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse220 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse220 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse219 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse219 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1)) (.cse215 (select (select (let ((.cse217 (let ((.cse218 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse218 v_prenex_5 (store (select .cse218 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse217 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse217 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse215) (= .cse5 .cse215) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse215) (= .cse216 v_prenex_5) (= .cse216 .cse215)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse221 (select (select (let ((.cse225 (let ((.cse226 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse226 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse226 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse225 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse225 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse221) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse222 (select (select (let ((.cse223 (let ((.cse224 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse224 v_prenex_5 (store (select .cse224 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse223 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse223 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse222) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse222) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse222) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= .cse221 .cse222))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse227 (select (select (let ((.cse233 (let ((.cse234 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse234 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse234 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse233 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse233 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse227) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse228 (select (select (let ((.cse229 (let ((.cse230 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse230 v_prenex_5 (store (select .cse230 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse229 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse229 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse228) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse228) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= .cse227 .cse228)))) (= .cse227 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse231 (let ((.cse232 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse232 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse232 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse231 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse231 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse236 (select (select (let ((.cse239 (let ((.cse240 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse240 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse240 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse239 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse239 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse235 (select (select (let ((.cse237 (let ((.cse238 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse238 v_prenex_5 (store (select .cse238 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse237 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse237 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse235) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse235) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse235) (= .cse236 .cse235)))) (= .cse236 v_prenex_5) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse236)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse241 (select (select (let ((.cse247 (let ((.cse248 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse248 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse248 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse247 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse247 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse241) (forall ((v_ArrVal_4873 (Array Int Int))) (= .cse1 (select (select (let ((.cse242 (let ((.cse243 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4873))) (store .cse243 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse243 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse242 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse242 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse5) .cse1))) (forall ((v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse244 (select (select (let ((.cse245 (let ((.cse246 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse246 v_prenex_5 (store (select .cse246 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse245 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse245 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse244) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse244) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= v_prenex_5 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse241 .cse244))))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_ArrVal_4874 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_prenex_6 (Array Int Int))) (let ((.cse249 (select (select (let ((.cse252 (let ((.cse253 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_6))) (store .cse253 v_prenex_5 (store (select .cse253 v_prenex_5) v_prenex_7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse252 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse252 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_prenex_5))) .cse5) .cse1))) (or (= v_prenex_5 .cse249) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse249) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse249) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_prenex_5) (= (select (select (let ((.cse250 (let ((.cse251 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4874))) (store .cse251 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse251 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse250 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse250 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse5) .cse1) .cse249)))))) is different from true [2023-11-29 03:07:56,561 INFO L349 Elim1Store]: treesize reduction 31, result has 58.1 percent of original size [2023-11-29 03:07:56,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 83297 treesize of output 59619 [2023-11-29 03:07:56,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:07:56,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35540 treesize of output 34028 [2023-11-29 03:07:57,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28189 treesize of output 26983 [2023-11-29 03:07:58,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35300 treesize of output 33254 [2023-11-29 03:08:00,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-11-29 03:08:28,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 74 [2023-11-29 03:11:59,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-11-29 03:11:59,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 104 [2023-11-29 03:11:59,242 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:11:59,243 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:11:59,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 03:11:59,277 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:11:59,278 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:11:59,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 03:11:59,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-11-29 03:11:59,403 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:11:59,404 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:11:59,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 03:11:59,486 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:11:59,487 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:11:59,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 03:11:59,523 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:11:59,524 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:11:59,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 03:11:59,580 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:11:59,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-11-29 03:11:59,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-11-29 03:11:59,810 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:11:59,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:11:59,900 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:11:59,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:11:59,929 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:11:59,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-11-29 03:12:00,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:00,063 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:00,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 03:12:00,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:00,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:12:00,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-11-29 03:12:00,253 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:00,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-11-29 03:12:00,293 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:00,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-11-29 03:12:00,467 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:00,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:12:00,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-11-29 03:12:00,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2023-11-29 03:12:00,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:00,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:00,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:12:00,773 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:00,774 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:00,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:12:00,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-11-29 03:12:00,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 104 [2023-11-29 03:12:01,046 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:12:01,075 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,075 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 03:12:01,154 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 03:12:01,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 107 [2023-11-29 03:12:01,243 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-11-29 03:12:01,285 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,285 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 03:12:01,414 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:12:01,432 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,433 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 03:12:01,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-11-29 03:12:01,578 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:12:01,603 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,604 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 03:12:01,684 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,685 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 03:12:01,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-11-29 03:12:01,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-11-29 03:12:01,844 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:01,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-11-29 03:12:02,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-11-29 03:12:02,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:02,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 03:12:02,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-11-29 03:12:02,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-11-29 03:12:14,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2023-11-29 03:12:14,440 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:14,659 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:14,676 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:14,678 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:14,683 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:14,693 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:14,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:14,706 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:14,711 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:14,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:14,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-11-29 03:12:15,022 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:15,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:12:15,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:15,035 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:15,038 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:15,041 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:15,044 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:15,049 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:15,050 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:15,053 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:15,056 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:15,059 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:15,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:15,063 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:15,066 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:16,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 236 [2023-11-29 03:12:16,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-11-29 03:12:16,448 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:16,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-11-29 03:12:16,486 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:16,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-11-29 03:12:16,746 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:16,756 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:16,758 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:16,764 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:17,224 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:17,414 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:17,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2023-11-29 03:12:19,889 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:19,891 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:22,413 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:22,414 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:22,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:12:22,844 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:22,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-11-29 03:12:23,036 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:25,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:25,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15362 treesize of output 12330 [2023-11-29 03:12:26,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,532 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 1 [2023-11-29 03:12:26,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,567 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 1 [2023-11-29 03:12:26,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,599 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 278 treesize of output 1 [2023-11-29 03:12:26,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,629 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 1 [2023-11-29 03:12:26,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,655 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 320 treesize of output 1 [2023-11-29 03:12:26,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,686 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 1 [2023-11-29 03:12:26,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,711 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 1 [2023-11-29 03:12:26,716 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,720 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:26,725 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,725 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,726 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,729 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:26,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,757 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 320 treesize of output 1 [2023-11-29 03:12:26,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,789 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 1 [2023-11-29 03:12:26,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,818 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 1 [2023-11-29 03:12:26,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,850 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 1 [2023-11-29 03:12:26,856 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,857 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,858 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,862 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:26,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,898 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 1 [2023-11-29 03:12:26,904 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,905 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,906 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,910 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:26,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,947 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 1 [2023-11-29 03:12:26,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:26,982 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:26,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 1 [2023-11-29 03:12:26,988 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,988 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,989 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:26,993 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:26,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:27,000 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:27,001 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:27,005 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:27,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,033 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 278 treesize of output 1 [2023-11-29 03:12:27,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,055 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 1 [2023-11-29 03:12:27,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,088 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 1 [2023-11-29 03:12:27,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,110 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 320 treesize of output 1 [2023-11-29 03:12:27,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,137 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 1 [2023-11-29 03:12:27,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,170 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 1 [2023-11-29 03:12:27,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,193 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 1 [2023-11-29 03:12:27,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,228 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 1 [2023-11-29 03:12:27,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,251 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 366 treesize of output 1 [2023-11-29 03:12:27,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,288 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 1 [2023-11-29 03:12:27,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,314 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 1 [2023-11-29 03:12:27,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,347 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 278 treesize of output 1 [2023-11-29 03:12:27,353 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:27,354 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:27,355 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:27,359 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:12:27,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,403 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 324 treesize of output 1 [2023-11-29 03:12:27,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,434 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 1 [2023-11-29 03:12:27,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:27,460 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:27,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 1 [2023-11-29 03:12:29,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743276313] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:12:29,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:12:29,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2023-11-29 03:12:29,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614446255] [2023-11-29 03:12:29,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:12:29,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-29 03:12:29,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:12:29,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-29 03:12:29,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2996, Unknown=2, NotChecked=110, Total=3306 [2023-11-29 03:12:29,215 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 46 states, 39 states have (on average 2.128205128205128) internal successors, (83), 40 states have internal predecessors, (83), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:12:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:12:37,347 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2023-11-29 03:12:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-29 03:12:37,347 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 39 states have (on average 2.128205128205128) internal successors, (83), 40 states have internal predecessors, (83), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-11-29 03:12:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:12:37,348 INFO L225 Difference]: With dead ends: 134 [2023-11-29 03:12:37,348 INFO L226 Difference]: Without dead ends: 134 [2023-11-29 03:12:37,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=402, Invalid=5300, Unknown=2, NotChecked=148, Total=5852 [2023-11-29 03:12:37,351 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 192 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:12:37,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 993 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-29 03:12:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-29 03:12:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 82. [2023-11-29 03:12:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:12:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-11-29 03:12:37,355 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 51 [2023-11-29 03:12:37,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:12:37,356 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-11-29 03:12:37,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 39 states have (on average 2.128205128205128) internal successors, (83), 40 states have internal predecessors, (83), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:12:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-11-29 03:12:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 03:12:37,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:12:37,357 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:12:37,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-29 03:12:37,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-29 03:12:37,558 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:12:37,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:12:37,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2022445769, now seen corresponding path program 1 times [2023-11-29 03:12:37,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:12:37,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215330878] [2023-11-29 03:12:37,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:12:37,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:12:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:41,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:41,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:12:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:41,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:12:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:12:42,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:12:42,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215330878] [2023-11-29 03:12:42,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215330878] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:12:42,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890520292] [2023-11-29 03:12:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:12:42,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:12:42,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:12:42,191 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:12:42,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 03:12:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:42,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-29 03:12:42,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:12:42,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:12:43,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:12:43,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:12:44,635 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 03:12:44,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-29 03:12:44,676 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 03:12:44,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 03:12:45,767 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 03:12:45,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 03:12:45,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-11-29 03:12:46,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:12:46,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:12:46,413 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:12:46,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:12:46,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:12:46,824 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-29 03:12:46,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2023-11-29 03:12:46,877 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 03:12:46,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 03:12:47,410 INFO L349 Elim1Store]: treesize reduction 69, result has 33.7 percent of original size [2023-11-29 03:12:47,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 116 [2023-11-29 03:12:47,499 INFO L349 Elim1Store]: treesize reduction 69, result has 33.7 percent of original size [2023-11-29 03:12:47,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 131 [2023-11-29 03:12:48,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:48,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 149 [2023-11-29 03:12:49,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:49,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 86 [2023-11-29 03:12:49,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2023-11-29 03:12:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:12:50,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:12:57,382 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_5186 Int)) (let ((.cse0 (select (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5181))) (store .cse7 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse7 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_ArrVal_5186))) .cse1) .cse5))) (or (= .cse0 .cse1) (< (+ (select (select (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5180))) (store .cse4 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse4 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse1) .cse5) 11) (select |c_#length| .cse0))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_5180 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse8 (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5180))) (store .cse10 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse10 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse1) .cse5))) (or (= .cse5 .cse8) (< 0 (+ 9 .cse8))))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (or (< 0 (+ 9 (select (select (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5180))) (store .cse12 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse12 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse1) .cse5))) (forall ((v_ArrVal_5186 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5181))) (store .cse14 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse14 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_ArrVal_5186))) .cse1) .cse5) .cse1)))) (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.base| Int) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse15 (select (select (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5180))) (store .cse19 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse19 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))))) (store .cse18 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse18 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse1) .cse5))) (or (= .cse5 .cse15) (forall ((v_ArrVal_5186 Int)) (<= (+ 12 .cse15) (select |c_#length| (select (select (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5181))) (store .cse17 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse17 |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse16 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_ArrVal_5186))) .cse1) .cse5))))))))) is different from false [2023-11-29 03:12:57,523 INFO L349 Elim1Store]: treesize reduction 31, result has 58.1 percent of original size [2023-11-29 03:12:57,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1667 treesize of output 1341 [2023-11-29 03:12:57,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:57,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4193 treesize of output 4081 [2023-11-29 03:12:57,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3795 treesize of output 3567 [2023-11-29 03:12:57,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-11-29 03:13:03,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1796 treesize of output 1676 [2023-11-29 03:13:04,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:04,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1720 treesize of output 1574 [2023-11-29 03:13:04,338 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,339 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,340 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,343 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:13:04,348 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:13:04,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:04,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 117 [2023-11-29 03:13:04,373 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:13:04,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:04,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 104 [2023-11-29 03:13:04,398 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:04,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 230 [2023-11-29 03:13:04,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:04,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 807 treesize of output 783 [2023-11-29 03:13:04,496 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 103 [2023-11-29 03:13:04,519 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 190 [2023-11-29 03:13:04,651 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 88 [2023-11-29 03:13:04,770 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 60 [2023-11-29 03:13:04,795 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:13:04,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:04,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 151 [2023-11-29 03:13:04,818 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:13:04,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:04,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 70 [2023-11-29 03:13:04,845 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:04,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 343 treesize of output 337 [2023-11-29 03:13:04,886 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:04,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 694 treesize of output 676 [2023-11-29 03:13:04,943 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 168 [2023-11-29 03:13:04,969 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:04,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 125 [2023-11-29 03:13:05,209 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:05,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 115 [2023-11-29 03:13:05,245 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:05,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2023-11-29 03:13:07,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890520292] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:13:07,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:13:07,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48 [2023-11-29 03:13:07,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452472483] [2023-11-29 03:13:07,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:13:07,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-29 03:13:07,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:13:07,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-29 03:13:07,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3462, Unknown=1, NotChecked=118, Total=3782 [2023-11-29 03:13:07,297 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 49 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 43 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:13:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:17,312 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2023-11-29 03:13:17,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 03:13:17,313 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 43 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-11-29 03:13:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:17,314 INFO L225 Difference]: With dead ends: 117 [2023-11-29 03:13:17,314 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 03:13:17,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=438, Invalid=6537, Unknown=1, NotChecked=164, Total=7140 [2023-11-29 03:13:17,317 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 356 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:17,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1280 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-11-29 03:13:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 03:13:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 84. [2023-11-29 03:13:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:13:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-11-29 03:13:17,320 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 51 [2023-11-29 03:13:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:17,321 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-11-29 03:13:17,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 43 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:13:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-11-29 03:13:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 03:13:17,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:17,321 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:17,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 03:13:17,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:13:17,522 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:13:17,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash 879711911, now seen corresponding path program 1 times [2023-11-29 03:13:17,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:13:17,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923185163] [2023-11-29 03:13:17,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:17,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:13:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:19,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:13:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:19,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:13:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:20,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:13:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:13:20,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:13:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923185163] [2023-11-29 03:13:20,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923185163] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:13:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776334386] [2023-11-29 03:13:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:20,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:13:20,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:13:20,681 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:13:20,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 03:13:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:21,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-29 03:13:21,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:22,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2023-11-29 03:13:22,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2023-11-29 03:13:22,342 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:13:22,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:13:23,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:13:23,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-29 03:13:23,244 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2023-11-29 03:13:23,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 03:13:24,824 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-11-29 03:13:24,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 25 [2023-11-29 03:13:24,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2023-11-29 03:13:25,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-11-29 03:13:25,413 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-11-29 03:13:25,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 37 [2023-11-29 03:13:25,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 03:13:25,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-29 03:13:25,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 24 [2023-11-29 03:13:25,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2023-11-29 03:13:26,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:26,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 20 [2023-11-29 03:13:26,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 03:13:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:13:26,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:13:26,952 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5491 (Array Int Int)) (v_ArrVal_5490 (Array Int Int))) (not (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5490) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5491))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse1) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))) is different from false [2023-11-29 03:13:26,971 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5491 (Array Int Int)) (v_ArrVal_5490 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5490) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5491) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5490) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5491) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))) is different from false [2023-11-29 03:13:26,993 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5491 (Array Int Int)) (v_ArrVal_5490 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5490) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5491) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5490) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5491) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-11-29 03:13:27,015 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5491 (Array Int Int)) (v_ArrVal_5490 (Array Int Int))) (not (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5490) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5491) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse1 v_ArrVal_5490) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5491) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-11-29 03:13:27,039 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5491 (Array Int Int)) (v_ArrVal_5490 (Array Int Int))) (not (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| 4)))) (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5490) .cse1 v_ArrVal_5491) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_5490) .cse1 v_ArrVal_5491) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) .cse1))) .cse3) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3))))) is different from false [2023-11-29 03:13:27,491 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5491 (Array Int Int)) (v_ArrVal_5490 (Array Int Int))) (not (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (select (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5490) .cse1 v_ArrVal_5491) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_5490) .cse1 v_ArrVal_5491) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) .cse1)))) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse4))))) is different from false [2023-11-29 03:13:27,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776334386] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:13:27,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:13:27,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 49 [2023-11-29 03:13:27,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96194974] [2023-11-29 03:13:27,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:13:27,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-29 03:13:27,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:13:27,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-29 03:13:27,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2566, Unknown=21, NotChecked=642, Total=3422 [2023-11-29 03:13:27,930 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 49 states, 43 states have (on average 2.0) internal successors, (86), 43 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:13:33,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:33,002 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2023-11-29 03:13:33,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 03:13:33,002 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 43 states have (on average 2.0) internal successors, (86), 43 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2023-11-29 03:13:33,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:33,003 INFO L225 Difference]: With dead ends: 88 [2023-11-29 03:13:33,003 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 03:13:33,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=309, Invalid=4116, Unknown=21, NotChecked=810, Total=5256 [2023-11-29 03:13:33,007 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 165 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:33,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1137 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 03:13:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 03:13:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2023-11-29 03:13:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:13:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-11-29 03:13:33,009 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 54 [2023-11-29 03:13:33,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:33,010 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-11-29 03:13:33,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 43 states have (on average 2.0) internal successors, (86), 43 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:13:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-11-29 03:13:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 03:13:33,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:33,010 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:33,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-29 03:13:33,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:13:33,211 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-11-29 03:13:33,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:33,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1532481772, now seen corresponding path program 1 times [2023-11-29 03:13:33,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:13:33,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294222712] [2023-11-29 03:13:33,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:33,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:13:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:37,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:13:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:37,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:13:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:13:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:39,074 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:13:39,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:13:39,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294222712] [2023-11-29 03:13:39,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294222712] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:13:39,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271239092] [2023-11-29 03:13:39,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:39,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:13:39,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:13:39,075 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:13:39,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5b550df-69f2-487e-ad16-da76086a5b80/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 03:13:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:39,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 184 conjunts are in the unsatisfiable core [2023-11-29 03:13:39,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:39,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:13:40,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 03:13:41,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:13:41,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:13:41,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:13:42,032 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2023-11-29 03:13:42,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 24 [2023-11-29 03:13:42,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:13:42,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:13:43,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:13:43,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:13:43,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:13:43,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:13:44,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 3 [2023-11-29 03:13:44,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-29 03:13:44,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-29 03:13:44,461 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 03:13:44,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 03:13:44,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 03:13:46,145 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 03:13:46,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-29 03:13:46,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:13:46,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-11-29 03:13:46,313 INFO L349 Elim1Store]: treesize reduction 104, result has 29.3 percent of original size [2023-11-29 03:13:46,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 60 [2023-11-29 03:13:49,606 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2023-11-29 03:13:49,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 82 [2023-11-29 03:13:49,702 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 03:13:49,702 INFO L378 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 2 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 03:13:50,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:13:50,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:13:50,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2023-11-29 03:13:50,948 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-11-29 03:13:50,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 101 [2023-11-29 03:13:50,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-29 03:13:50,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:13:51,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-11-29 03:13:51,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 03:13:51,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2023-11-29 03:13:51,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 03:13:51,591 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 03:13:51,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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 [2023-11-29 03:13:52,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 41 [2023-11-29 03:13:52,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 73 [2023-11-29 03:13:52,125 INFO L378 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 32 treesize of output 19 [2023-11-29 03:13:53,513 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-29 03:13:53,514 INFO L378 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 2 case distinctions, treesize of input 153 treesize of output 64 [2023-11-29 03:13:53,527 INFO L378 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2023-11-29 03:13:53,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:13:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:13:54,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:13:58,731 INFO L349 Elim1Store]: treesize reduction 31, result has 58.1 percent of original size [2023-11-29 03:13:58,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 12987 treesize of output 11557 [2023-11-29 03:13:58,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:58,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 10983 treesize of output 10871 [2023-11-29 03:13:58,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15171 treesize of output 14847 [2023-11-29 03:13:59,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-11-29 03:13:59,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 03:14:01,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:01,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2351 treesize of output 2307 [2023-11-29 03:14:58,779 WARN L293 SmtUtils]: Spent 27.96s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 03:14:58,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:58,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114866 treesize of output 113752