./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:39:20,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:39:20,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:39:20,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:39:20,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:39:20,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:39:20,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:39:20,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:39:20,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:39:20,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:39:20,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:39:20,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:39:20,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:39:20,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:39:20,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:39:20,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:39:20,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:39:20,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:39:20,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:39:20,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:39:20,140 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:39:20,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:39:20,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:39:20,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:39:20,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:39:20,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:39:20,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:39:20,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:39:20,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:39:20,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:39:20,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:39:20,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:39:20,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:39:20,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:39:20,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:39:20,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:39:20,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:39:20,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:39:20,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:39:20,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:39:20,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:39:20,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:39:20,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:39:20,180 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:39:20,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:39:20,180 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:39:20,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:39:20,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:39:20,181 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:39:20,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:39:20,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:39:20,182 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:39:20,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:39:20,183 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:39:20,183 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:39:20,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:39:20,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:39:20,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:39:20,184 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:39:20,184 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:39:20,184 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:39:20,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:39:20,184 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:39:20,185 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:39:20,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:39:20,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:39:20,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:39:20,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:39:20,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:39:20,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:39:20,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:39:20,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:39:20,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:39:20,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2022-07-23 06:39:20,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:39:20,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:39:20,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:39:20,408 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:39:20,408 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:39:20,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2022-07-23 06:39:20,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c40528d0d/9b5acdd725794a2e8c13ceb5c86b2085/FLAG362bbee7c [2022-07-23 06:39:20,902 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:39:20,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2022-07-23 06:39:20,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c40528d0d/9b5acdd725794a2e8c13ceb5c86b2085/FLAG362bbee7c [2022-07-23 06:39:20,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c40528d0d/9b5acdd725794a2e8c13ceb5c86b2085 [2022-07-23 06:39:20,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:39:20,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:39:20,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:39:20,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:39:20,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:39:20,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:39:20" (1/1) ... [2022-07-23 06:39:20,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78807f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:20, skipping insertion in model container [2022-07-23 06:39:20,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:39:20" (1/1) ... [2022-07-23 06:39:20,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:39:20,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:39:21,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:39:21,251 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:39:21,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:39:21,315 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:39:21,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:21 WrapperNode [2022-07-23 06:39:21,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:39:21,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:39:21,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:39:21,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:39:21,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:21" (1/1) ... [2022-07-23 06:39:21,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:21" (1/1) ... [2022-07-23 06:39:21,353 INFO L137 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 128 [2022-07-23 06:39:21,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:39:21,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:39:21,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:39:21,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:39:21,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:21" (1/1) ... [2022-07-23 06:39:21,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:21" (1/1) ... [2022-07-23 06:39:21,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:21" (1/1) ... [2022-07-23 06:39:21,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:21" (1/1) ... [2022-07-23 06:39:21,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:21" (1/1) ... [2022-07-23 06:39:21,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:21" (1/1) ... [2022-07-23 06:39:21,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:21" (1/1) ... [2022-07-23 06:39:21,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:39:21,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:39:21,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:39:21,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:39:21,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:21" (1/1) ... [2022-07-23 06:39:21,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:39:21,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:21,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 06:39:21,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 06:39:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-23 06:39:21,446 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-23 06:39:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:39:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:39:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:39:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:39:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:39:21,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:39:21,507 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:39:21,510 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:39:21,544 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-23 06:39:21,749 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:39:21,755 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:39:21,755 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 06:39:21,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:39:21 BoogieIcfgContainer [2022-07-23 06:39:21,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:39:21,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:39:21,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:39:21,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:39:21,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:39:20" (1/3) ... [2022-07-23 06:39:21,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e221db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:39:21, skipping insertion in model container [2022-07-23 06:39:21,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:21" (2/3) ... [2022-07-23 06:39:21,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e221db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:39:21, skipping insertion in model container [2022-07-23 06:39:21,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:39:21" (3/3) ... [2022-07-23 06:39:21,763 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2022-07-23 06:39:21,773 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:39:21,773 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-07-23 06:39:21,830 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:39:21,835 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12528d42, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d87e3 [2022-07-23 06:39:21,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2022-07-23 06:39:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 06:39:21,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:21,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 06:39:21,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:21,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-07-23 06:39:21,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:21,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984112682] [2022-07-23 06:39:21,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:21,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:21,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:21,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984112682] [2022-07-23 06:39:21,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984112682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:21,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:21,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:39:21,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782000142] [2022-07-23 06:39:21,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:21,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:39:22,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:22,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:39:22,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:39:22,027 INFO L87 Difference]: Start difference. First operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:22,137 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2022-07-23 06:39:22,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:39:22,139 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-23 06:39:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:22,144 INFO L225 Difference]: With dead ends: 136 [2022-07-23 06:39:22,144 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:39:22,145 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 [2022-07-23 06:39:22,147 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:22,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 175 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:39:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:39:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-23 06:39:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 129 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2022-07-23 06:39:22,176 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 4 [2022-07-23 06:39:22,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:22,177 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2022-07-23 06:39:22,177 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2022-07-23 06:39:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 06:39:22,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:22,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 06:39:22,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:39:22,178 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:22,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:22,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-07-23 06:39:22,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:22,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878813915] [2022-07-23 06:39:22,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:22,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:22,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:22,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878813915] [2022-07-23 06:39:22,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878813915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:22,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:22,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:39:22,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983516417] [2022-07-23 06:39:22,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:22,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:39:22,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:22,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:39:22,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:39:22,218 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:22,246 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-07-23 06:39:22,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:39:22,247 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-23 06:39:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:22,249 INFO L225 Difference]: With dead ends: 127 [2022-07-23 06:39:22,249 INFO L226 Difference]: Without dead ends: 127 [2022-07-23 06:39:22,250 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 [2022-07-23 06:39:22,251 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 128 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:22,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 117 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:39:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-23 06:39:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-23 06:39:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-07-23 06:39:22,257 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 4 [2022-07-23 06:39:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:22,258 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-07-23 06:39:22,258 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-07-23 06:39:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:39:22,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:22,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:22,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:39:22,259 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2022-07-23 06:39:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:22,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599960157] [2022-07-23 06:39:22,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:22,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:22,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:22,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599960157] [2022-07-23 06:39:22,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599960157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:22,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:22,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:39:22,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137611551] [2022-07-23 06:39:22,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:22,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:39:22,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:22,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:39:22,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:39:22,292 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:22,302 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-07-23 06:39:22,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:39:22,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-23 06:39:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:22,303 INFO L225 Difference]: With dead ends: 136 [2022-07-23 06:39:22,303 INFO L226 Difference]: Without dead ends: 136 [2022-07-23 06:39:22,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:39:22,304 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 8 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:22,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 254 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:39:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-23 06:39:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2022-07-23 06:39:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2022-07-23 06:39:22,314 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 9 [2022-07-23 06:39:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:22,314 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2022-07-23 06:39:22,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-07-23 06:39:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:39:22,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:22,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:22,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:39:22,315 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:22,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:22,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2022-07-23 06:39:22,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:22,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181363110] [2022-07-23 06:39:22,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:22,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:22,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:22,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181363110] [2022-07-23 06:39:22,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181363110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:22,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:22,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:39:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785876974] [2022-07-23 06:39:22,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:22,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:39:22,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:22,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:39:22,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:39:22,363 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:22,429 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-07-23 06:39:22,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:39:22,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-23 06:39:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:22,430 INFO L225 Difference]: With dead ends: 127 [2022-07-23 06:39:22,430 INFO L226 Difference]: Without dead ends: 127 [2022-07-23 06:39:22,430 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 [2022-07-23 06:39:22,431 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 40 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:22,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 169 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:39:22,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-23 06:39:22,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-23 06:39:22,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-07-23 06:39:22,448 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 9 [2022-07-23 06:39:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:22,449 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-07-23 06:39:22,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-07-23 06:39:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:39:22,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:22,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:22,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:39:22,449 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:22,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:22,450 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2022-07-23 06:39:22,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:22,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6655141] [2022-07-23 06:39:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:22,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:22,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:22,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6655141] [2022-07-23 06:39:22,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6655141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:22,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:22,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:39:22,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715598968] [2022-07-23 06:39:22,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:22,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:39:22,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:22,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:39:22,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:39:22,490 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:22,505 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2022-07-23 06:39:22,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:39:22,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-23 06:39:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:22,507 INFO L225 Difference]: With dead ends: 126 [2022-07-23 06:39:22,507 INFO L226 Difference]: Without dead ends: 126 [2022-07-23 06:39:22,507 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 [2022-07-23 06:39:22,516 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 122 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:22,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 121 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:39:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-23 06:39:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-23 06:39:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 125 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2022-07-23 06:39:22,521 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 9 [2022-07-23 06:39:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:22,521 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2022-07-23 06:39:22,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2022-07-23 06:39:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:39:22,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:22,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:22,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:39:22,522 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:22,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:22,522 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2022-07-23 06:39:22,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:22,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106357484] [2022-07-23 06:39:22,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:22,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:22,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:22,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106357484] [2022-07-23 06:39:22,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106357484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:22,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:22,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:39:22,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714391522] [2022-07-23 06:39:22,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:22,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:39:22,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:22,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:39:22,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:39:22,573 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:22,666 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-07-23 06:39:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:39:22,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:39:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:22,667 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:39:22,667 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:39:22,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:39:22,669 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:22,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 217 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:39:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:39:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-07-23 06:39:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.8) internal successors, (135), 128 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2022-07-23 06:39:22,681 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 10 [2022-07-23 06:39:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:22,681 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2022-07-23 06:39:22,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2022-07-23 06:39:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:39:22,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:22,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:22,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 06:39:22,682 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2022-07-23 06:39:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:22,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556436661] [2022-07-23 06:39:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:22,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:22,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556436661] [2022-07-23 06:39:22,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556436661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:22,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:22,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:39:22,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154135216] [2022-07-23 06:39:22,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:22,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:39:22,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:22,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:39:22,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:39:22,793 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:22,871 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-07-23 06:39:22,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:39:22,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:39:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:22,873 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:39:22,873 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:39:22,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:39:22,875 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 132 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:22,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 263 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:39:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:39:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-07-23 06:39:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2022-07-23 06:39:22,895 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 10 [2022-07-23 06:39:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:22,895 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2022-07-23 06:39:22,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2022-07-23 06:39:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 06:39:22,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:22,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:22,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 06:39:22,896 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2022-07-23 06:39:22,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:22,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096532547] [2022-07-23 06:39:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:22,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:22,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096532547] [2022-07-23 06:39:22,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096532547] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:22,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143458498] [2022-07-23 06:39:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:22,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:22,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:22,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:22,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 06:39:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:23,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:39:23,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:23,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:23,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143458498] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:23,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:23,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-23 06:39:23,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524085193] [2022-07-23 06:39:23,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:23,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:39:23,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:23,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:39:23,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:39:23,079 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:23,088 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2022-07-23 06:39:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:39:23,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-23 06:39:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:23,104 INFO L225 Difference]: With dead ends: 131 [2022-07-23 06:39:23,104 INFO L226 Difference]: Without dead ends: 131 [2022-07-23 06:39:23,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:39:23,105 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 14 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:23,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 489 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:39:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-23 06:39:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-23 06:39:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 130 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2022-07-23 06:39:23,108 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 14 [2022-07-23 06:39:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:23,108 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2022-07-23 06:39:23,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2022-07-23 06:39:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:39:23,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:23,109 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:23,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:23,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:23,333 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2022-07-23 06:39:23,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:23,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719093884] [2022-07-23 06:39:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:23,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:23,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719093884] [2022-07-23 06:39:23,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719093884] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:23,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307187706] [2022-07-23 06:39:23,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:23,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:23,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:23,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:23,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 06:39:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:23,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:39:23,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:23,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:39:23,512 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:39:23,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:23,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:23,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307187706] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:23,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:23,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-07-23 06:39:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996145492] [2022-07-23 06:39:23,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:23,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:39:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:23,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:39:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:39:23,621 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:23,654 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2022-07-23 06:39:23,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:39:23,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-23 06:39:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:23,656 INFO L225 Difference]: With dead ends: 129 [2022-07-23 06:39:23,656 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 06:39:23,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:39:23,657 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 138 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:23,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 278 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 69 Unchecked, 0.0s Time] [2022-07-23 06:39:23,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 06:39:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-23 06:39:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:23,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2022-07-23 06:39:23,662 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 15 [2022-07-23 06:39:23,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:23,662 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2022-07-23 06:39:23,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2022-07-23 06:39:23,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:39:23,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:23,663 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:23,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:23,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-23 06:39:23,880 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:23,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:23,880 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2022-07-23 06:39:23,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:23,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293075738] [2022-07-23 06:39:23,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:23,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:23,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:23,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293075738] [2022-07-23 06:39:23,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293075738] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:23,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792812404] [2022-07-23 06:39:23,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:23,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:23,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:23,950 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:23,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 06:39:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:24,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 06:39:24,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:24,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:39:24,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:39:24,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:24,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:24,105 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:39:24,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:24,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:24,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792812404] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:24,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:24,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-07-23 06:39:24,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089315043] [2022-07-23 06:39:24,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:24,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:39:24,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:24,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:39:24,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:39:24,270 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:24,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:24,452 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-07-23 06:39:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:39:24,453 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-23 06:39:24,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:24,454 INFO L225 Difference]: With dead ends: 127 [2022-07-23 06:39:24,454 INFO L226 Difference]: Without dead ends: 127 [2022-07-23 06:39:24,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-07-23 06:39:24,455 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 496 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:24,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 344 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 138 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2022-07-23 06:39:24,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-23 06:39:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-23 06:39:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-07-23 06:39:24,457 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 15 [2022-07-23 06:39:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:24,457 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-07-23 06:39:24,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-07-23 06:39:24,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:39:24,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:24,458 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:24,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:24,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:24,697 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:24,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:24,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2022-07-23 06:39:24,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:24,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038462405] [2022-07-23 06:39:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:24,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 06:39:24,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:24,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038462405] [2022-07-23 06:39:24,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038462405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:24,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:24,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:39:24,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507422649] [2022-07-23 06:39:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:24,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:39:24,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:24,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:39:24,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:39:24,768 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:24,882 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-23 06:39:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:39:24,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-23 06:39:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:24,883 INFO L225 Difference]: With dead ends: 124 [2022-07-23 06:39:24,883 INFO L226 Difference]: Without dead ends: 124 [2022-07-23 06:39:24,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:39:24,884 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 107 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:24,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 325 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:39:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-23 06:39:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-23 06:39:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 123 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2022-07-23 06:39:24,887 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 22 [2022-07-23 06:39:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:24,887 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2022-07-23 06:39:24,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2022-07-23 06:39:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:39:24,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:24,888 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:24,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 06:39:24,888 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:24,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:24,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2022-07-23 06:39:24,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:24,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309234071] [2022-07-23 06:39:24,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:39:24,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:24,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309234071] [2022-07-23 06:39:24,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309234071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:24,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:24,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:39:24,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816330702] [2022-07-23 06:39:24,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:24,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:39:24,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:24,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:39:24,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:39:24,957 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:25,035 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2022-07-23 06:39:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:39:25,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-23 06:39:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:25,036 INFO L225 Difference]: With dead ends: 117 [2022-07-23 06:39:25,036 INFO L226 Difference]: Without dead ends: 117 [2022-07-23 06:39:25,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:39:25,037 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 412 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:25,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 95 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:39:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-23 06:39:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-23 06:39:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.5844155844155845) internal successors, (122), 116 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2022-07-23 06:39:25,039 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 22 [2022-07-23 06:39:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:25,039 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2022-07-23 06:39:25,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2022-07-23 06:39:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:39:25,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:25,040 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, 1, 1, 1] [2022-07-23 06:39:25,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 06:39:25,040 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:25,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:25,041 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2022-07-23 06:39:25,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:25,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441465836] [2022-07-23 06:39:25,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:25,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:39:25,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:25,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441465836] [2022-07-23 06:39:25,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441465836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:25,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:25,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:39:25,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506889500] [2022-07-23 06:39:25,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:25,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:39:25,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:25,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:39:25,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:39:25,085 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:25,155 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-07-23 06:39:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:39:25,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-23 06:39:25,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:25,156 INFO L225 Difference]: With dead ends: 112 [2022-07-23 06:39:25,156 INFO L226 Difference]: Without dead ends: 112 [2022-07-23 06:39:25,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:39:25,157 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 386 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:25,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 84 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:39:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-23 06:39:25,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-23 06:39:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 111 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2022-07-23 06:39:25,159 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 28 [2022-07-23 06:39:25,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:25,160 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2022-07-23 06:39:25,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2022-07-23 06:39:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:39:25,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:25,160 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, 1, 1, 1] [2022-07-23 06:39:25,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 06:39:25,161 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:25,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2022-07-23 06:39:25,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:25,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238960323] [2022-07-23 06:39:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:25,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:39:25,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:25,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238960323] [2022-07-23 06:39:25,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238960323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:25,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:25,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:39:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664255695] [2022-07-23 06:39:25,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:25,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:39:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:39:25,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:39:25,258 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:25,397 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-07-23 06:39:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:39:25,397 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-23 06:39:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:25,398 INFO L225 Difference]: With dead ends: 107 [2022-07-23 06:39:25,398 INFO L226 Difference]: Without dead ends: 107 [2022-07-23 06:39:25,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:39:25,398 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 548 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:25,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 162 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:39:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-23 06:39:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-23 06:39:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2022-07-23 06:39:25,401 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 28 [2022-07-23 06:39:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:25,401 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2022-07-23 06:39:25,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-07-23 06:39:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:39:25,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:25,402 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, 1, 1, 1] [2022-07-23 06:39:25,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 06:39:25,402 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:25,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:25,402 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2022-07-23 06:39:25,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:25,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743897968] [2022-07-23 06:39:25,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:25,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:25,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:25,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743897968] [2022-07-23 06:39:25,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743897968] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:25,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680537180] [2022-07-23 06:39:25,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:25,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:25,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:25,558 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:25,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 06:39:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:25,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-23 06:39:25,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:25,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:39:25,763 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:39:25,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-07-23 06:39:25,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:25,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:39:25,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:39:25,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:25,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:39:25,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:25,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2022-07-23 06:39:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:25,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:25,991 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) is different from false [2022-07-23 06:39:25,999 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-23 06:39:26,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-23 06:39:26,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:26,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 22 [2022-07-23 06:39:26,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 52 [2022-07-23 06:39:26,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 44 [2022-07-23 06:39:26,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-23 06:39:26,169 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:39:26,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2022-07-23 06:39:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-23 06:39:26,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680537180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:26,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:26,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 35 [2022-07-23 06:39:26,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772854752] [2022-07-23 06:39:26,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:26,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 06:39:26,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:26,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 06:39:26,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=952, Unknown=3, NotChecked=192, Total=1260 [2022-07-23 06:39:26,177 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:26,887 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-07-23 06:39:26,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 06:39:26,887 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-23 06:39:26,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:26,888 INFO L225 Difference]: With dead ends: 106 [2022-07-23 06:39:26,888 INFO L226 Difference]: Without dead ends: 106 [2022-07-23 06:39:26,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=1896, Unknown=3, NotChecked=282, Total=2550 [2022-07-23 06:39:26,889 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 775 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:26,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 662 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 715 Invalid, 0 Unknown, 487 Unchecked, 0.3s Time] [2022-07-23 06:39:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-23 06:39:26,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-07-23 06:39:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-07-23 06:39:26,891 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 28 [2022-07-23 06:39:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:26,891 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-07-23 06:39:26,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-07-23 06:39:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:39:26,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:26,892 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, 1, 1, 1, 1] [2022-07-23 06:39:26,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:27,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-23 06:39:27,103 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2022-07-23 06:39:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:27,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251308045] [2022-07-23 06:39:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:27,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:39:27,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:27,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251308045] [2022-07-23 06:39:27,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251308045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:27,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:27,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:39:27,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851768481] [2022-07-23 06:39:27,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:27,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:39:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:27,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:39:27,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:39:27,213 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:27,414 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-07-23 06:39:27,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:39:27,414 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-23 06:39:27,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:27,415 INFO L225 Difference]: With dead ends: 97 [2022-07-23 06:39:27,415 INFO L226 Difference]: Without dead ends: 97 [2022-07-23 06:39:27,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:39:27,415 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 572 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:27,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 75 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:39:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-23 06:39:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-23 06:39:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2022-07-23 06:39:27,417 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 29 [2022-07-23 06:39:27,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:27,417 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2022-07-23 06:39:27,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2022-07-23 06:39:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:39:27,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:27,418 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, 1, 1, 1, 1] [2022-07-23 06:39:27,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 06:39:27,418 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:27,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:27,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2022-07-23 06:39:27,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:27,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688375549] [2022-07-23 06:39:27,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:27,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:27,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:27,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688375549] [2022-07-23 06:39:27,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688375549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:27,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068869702] [2022-07-23 06:39:27,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:27,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:27,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:27,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:27,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 06:39:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:27,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-23 06:39:27,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:27,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:39:27,763 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:39:27,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-07-23 06:39:27,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:27,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:39:27,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 38 [2022-07-23 06:39:27,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:27,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 38 [2022-07-23 06:39:28,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 25 [2022-07-23 06:39:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:28,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:28,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:39:28,070 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:39:28,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:39:28,082 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:28,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-07-23 06:39:28,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 60 [2022-07-23 06:39:28,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 52 [2022-07-23 06:39:28,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 24 [2022-07-23 06:39:28,255 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-07-23 06:39:28,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 55 [2022-07-23 06:39:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-23 06:39:28,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068869702] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:28,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:28,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-07-23 06:39:28,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156069034] [2022-07-23 06:39:28,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:28,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-23 06:39:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:28,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-23 06:39:28,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=581, Unknown=3, NotChecked=150, Total=812 [2022-07-23 06:39:28,290 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:28,961 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2022-07-23 06:39:28,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:39:28,962 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-23 06:39:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:28,962 INFO L225 Difference]: With dead ends: 177 [2022-07-23 06:39:28,962 INFO L226 Difference]: Without dead ends: 177 [2022-07-23 06:39:28,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=983, Unknown=3, NotChecked=198, Total=1332 [2022-07-23 06:39:28,963 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 491 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 547 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:28,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 710 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 821 Invalid, 0 Unknown, 547 Unchecked, 0.4s Time] [2022-07-23 06:39:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-23 06:39:28,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 136. [2022-07-23 06:39:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 135 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-07-23 06:39:28,966 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 29 [2022-07-23 06:39:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:28,966 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-07-23 06:39:28,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-07-23 06:39:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:39:28,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:28,966 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, 1, 1, 1, 1, 1] [2022-07-23 06:39:28,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:29,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-23 06:39:29,176 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:29,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:29,177 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2022-07-23 06:39:29,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:29,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55616969] [2022-07-23 06:39:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:29,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:39:29,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:29,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55616969] [2022-07-23 06:39:29,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55616969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:29,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:29,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:39:29,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329116783] [2022-07-23 06:39:29,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:29,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:39:29,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:29,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:39:29,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:39:29,298 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:29,507 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2022-07-23 06:39:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:39:29,507 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-23 06:39:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:29,508 INFO L225 Difference]: With dead ends: 135 [2022-07-23 06:39:29,508 INFO L226 Difference]: Without dead ends: 135 [2022-07-23 06:39:29,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:39:29,508 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 233 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:29,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 286 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:39:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-23 06:39:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-07-23 06:39:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 116 states have (on average 1.2672413793103448) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2022-07-23 06:39:29,511 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 30 [2022-07-23 06:39:29,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:29,511 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2022-07-23 06:39:29,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2022-07-23 06:39:29,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:39:29,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:29,511 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, 1, 1, 1, 1, 1] [2022-07-23 06:39:29,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 06:39:29,511 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:29,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:29,512 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2022-07-23 06:39:29,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:29,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661986444] [2022-07-23 06:39:29,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:29,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:29,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:29,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661986444] [2022-07-23 06:39:29,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661986444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:29,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473632442] [2022-07-23 06:39:29,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:29,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:29,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:29,645 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:29,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 06:39:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:29,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-23 06:39:29,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:29,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:39:29,747 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:29,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:29,769 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:39:29,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-07-23 06:39:29,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:29,799 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:29,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-23 06:39:29,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-07-23 06:39:29,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:29,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-07-23 06:39:29,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:29,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 22 [2022-07-23 06:39:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:29,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:30,092 INFO L356 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2022-07-23 06:39:30,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 [2022-07-23 06:39:30,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_709) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_710) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) is different from false [2022-07-23 06:39:30,124 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:30,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 35 [2022-07-23 06:39:30,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 235 treesize of output 215 [2022-07-23 06:39:30,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 195 treesize of output 187 [2022-07-23 06:39:30,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 187 treesize of output 171 [2022-07-23 06:39:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-23 06:39:30,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473632442] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:30,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:30,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 28 [2022-07-23 06:39:30,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425881493] [2022-07-23 06:39:30,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:30,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-23 06:39:30,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:30,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-23 06:39:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=673, Unknown=2, NotChecked=52, Total=812 [2022-07-23 06:39:30,306 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:30,940 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2022-07-23 06:39:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 06:39:30,941 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-23 06:39:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:30,941 INFO L225 Difference]: With dead ends: 134 [2022-07-23 06:39:30,941 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 06:39:30,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=314, Invalid=1248, Unknown=2, NotChecked=76, Total=1640 [2022-07-23 06:39:30,942 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 189 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:30,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 901 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 697 Invalid, 0 Unknown, 152 Unchecked, 0.3s Time] [2022-07-23 06:39:30,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 06:39:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-23 06:39:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-07-23 06:39:30,945 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 30 [2022-07-23 06:39:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:30,945 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-07-23 06:39:30,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-07-23 06:39:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:39:30,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:30,946 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:30,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:31,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:31,159 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:31,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:31,160 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2022-07-23 06:39:31,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:31,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74658940] [2022-07-23 06:39:31,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:31,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:31,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:31,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74658940] [2022-07-23 06:39:31,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74658940] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:31,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924214658] [2022-07-23 06:39:31,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:31,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:31,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:31,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:31,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-23 06:39:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:31,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-23 06:39:31,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:31,476 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:39:31,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:31,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:39:31,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:31,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 23 [2022-07-23 06:39:31,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:31,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:31,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-23 06:39:31,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 22 [2022-07-23 06:39:31,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2022-07-23 06:39:31,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:31,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:31,933 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:39:31,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-07-23 06:39:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:31,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924214658] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:31,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:31,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2022-07-23 06:39:31,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421787763] [2022-07-23 06:39:31,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:31,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-23 06:39:31,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:31,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-23 06:39:31,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2022-07-23 06:39:31,938 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:32,392 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2022-07-23 06:39:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:39:32,393 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-23 06:39:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:32,393 INFO L225 Difference]: With dead ends: 133 [2022-07-23 06:39:32,393 INFO L226 Difference]: Without dead ends: 133 [2022-07-23 06:39:32,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=282, Invalid=1358, Unknown=0, NotChecked=0, Total=1640 [2022-07-23 06:39:32,395 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 424 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:32,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 577 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 729 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2022-07-23 06:39:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-23 06:39:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-07-23 06:39:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 116 states have (on average 1.2413793103448276) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-07-23 06:39:32,403 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 33 [2022-07-23 06:39:32,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:32,403 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-07-23 06:39:32,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-07-23 06:39:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:39:32,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:32,403 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:32,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:32,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:32,625 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:32,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:32,625 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2022-07-23 06:39:32,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:32,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167720156] [2022-07-23 06:39:32,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:32,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:32,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:32,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167720156] [2022-07-23 06:39:32,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167720156] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:32,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208551157] [2022-07-23 06:39:32,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:32,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:32,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:32,813 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:32,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-23 06:39:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:32,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-23 06:39:32,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:32,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:39:32,947 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:32,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:33,003 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:39:33,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-07-23 06:39:33,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:33,027 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:33,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-23 06:39:33,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-07-23 06:39:33,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:33,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-07-23 06:39:33,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:33,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2022-07-23 06:39:33,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:33,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:33,425 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_881) 0)) 1)) (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2022-07-23 06:39:33,444 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0)) 1)) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|))))) is different from false [2022-07-23 06:39:33,456 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:33,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 61 [2022-07-23 06:39:33,491 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_881 Int) (v_ArrVal_879 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int) (v_ArrVal_880 (Array Int Int))) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ v_prenex_3 4) v_prenex_1) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_3))))) is different from false [2022-07-23 06:39:33,498 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:33,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 28 [2022-07-23 06:39:33,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 171 treesize of output 165 [2022-07-23 06:39:33,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 210 treesize of output 202 [2022-07-23 06:39:33,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:33,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 235 treesize of output 237 [2022-07-23 06:39:33,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 250 treesize of output 246 [2022-07-23 06:39:33,552 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:39:33,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 1 [2022-07-23 06:39:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-23 06:39:33,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208551157] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:33,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:33,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2022-07-23 06:39:33,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014617920] [2022-07-23 06:39:33,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:33,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-23 06:39:33,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:33,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-23 06:39:33,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=793, Unknown=3, NotChecked=174, Total=1056 [2022-07-23 06:39:33,578 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:36,831 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0)) 1)) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-23 06:39:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:42,221 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-07-23 06:39:42,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 06:39:42,221 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-23 06:39:42,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:42,222 INFO L225 Difference]: With dead ends: 132 [2022-07-23 06:39:42,222 INFO L226 Difference]: Without dead ends: 132 [2022-07-23 06:39:42,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=235, Invalid=1499, Unknown=4, NotChecked=332, Total=2070 [2022-07-23 06:39:42,223 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 179 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:42,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 803 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 666 Invalid, 0 Unknown, 341 Unchecked, 0.3s Time] [2022-07-23 06:39:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-23 06:39:42,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-23 06:39:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.2327586206896552) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-07-23 06:39:42,227 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 33 [2022-07-23 06:39:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:42,227 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-07-23 06:39:42,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-07-23 06:39:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:39:42,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:42,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:42,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-23 06:39:42,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-23 06:39:42,437 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:42,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:42,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2022-07-23 06:39:42,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:42,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464490751] [2022-07-23 06:39:42,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:42,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:42,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:42,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464490751] [2022-07-23 06:39:42,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464490751] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:42,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822615894] [2022-07-23 06:39:42,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:42,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:42,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:42,746 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:42,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-23 06:39:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:42,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-23 06:39:42,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:42,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:39:42,881 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:39:42,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:42,961 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 06:39:42,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:42,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:39:43,022 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:43,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-23 06:39:43,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 30 [2022-07-23 06:39:43,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:43,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 [2022-07-23 06:39:43,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:43,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 24 [2022-07-23 06:39:43,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:43,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:43,454 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_968 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2022-07-23 06:39:43,470 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_ArrVal_968 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1))) is different from false [2022-07-23 06:39:43,477 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:43,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 41 [2022-07-23 06:39:43,492 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int)) (v_ArrVal_967 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_967) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2022-07-23 06:39:43,496 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:43,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2022-07-23 06:39:43,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 57 [2022-07-23 06:39:43,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:43,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:43,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:43,516 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:39:43,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2022-07-23 06:39:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-23 06:39:43,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822615894] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:43,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:43,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 50 [2022-07-23 06:39:43,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104861750] [2022-07-23 06:39:43,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:43,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-23 06:39:43,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:43,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-23 06:39:43,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2070, Unknown=3, NotChecked=282, Total=2550 [2022-07-23 06:39:43,770 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:45,154 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2022-07-23 06:39:45,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-23 06:39:45,154 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-23 06:39:45,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:45,155 INFO L225 Difference]: With dead ends: 167 [2022-07-23 06:39:45,155 INFO L226 Difference]: Without dead ends: 167 [2022-07-23 06:39:45,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=608, Invalid=5554, Unknown=12, NotChecked=468, Total=6642 [2022-07-23 06:39:45,156 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 393 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:45,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 901 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1029 Invalid, 0 Unknown, 558 Unchecked, 0.4s Time] [2022-07-23 06:39:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-23 06:39:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 131. [2022-07-23 06:39:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.2241379310344827) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2022-07-23 06:39:45,158 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 34 [2022-07-23 06:39:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:45,159 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2022-07-23 06:39:45,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-07-23 06:39:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:39:45,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:45,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:45,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:45,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:45,376 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1554055919, now seen corresponding path program 1 times [2022-07-23 06:39:45,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:45,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352477326] [2022-07-23 06:39:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:45,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:45,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:45,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352477326] [2022-07-23 06:39:45,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352477326] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:45,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015381511] [2022-07-23 06:39:45,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:45,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:45,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:45,572 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:45,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-23 06:39:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:45,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-23 06:39:45,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:45,715 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:39:45,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:45,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:39:45,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:45,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 18 [2022-07-23 06:39:45,923 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:39:45,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-23 06:39:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:45,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:46,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 32 [2022-07-23 06:39:46,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-23 06:39:46,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 22 [2022-07-23 06:39:46,170 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:39:46,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-07-23 06:39:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:46,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015381511] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:46,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:46,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 30 [2022-07-23 06:39:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394331156] [2022-07-23 06:39:46,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:46,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-23 06:39:46,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:46,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-23 06:39:46,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2022-07-23 06:39:46,176 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:46,691 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-07-23 06:39:46,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:39:46,692 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-23 06:39:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:46,692 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:39:46,692 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:39:46,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2022-07-23 06:39:46,694 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 637 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:46,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 450 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 406 Invalid, 0 Unknown, 167 Unchecked, 0.2s Time] [2022-07-23 06:39:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:39:46,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-23 06:39:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 116 states have (on average 1.206896551724138) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2022-07-23 06:39:46,696 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 34 [2022-07-23 06:39:46,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:46,696 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2022-07-23 06:39:46,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2022-07-23 06:39:46,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:39:46,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:46,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:46,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:46,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-23 06:39:46,914 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:46,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:46,914 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2022-07-23 06:39:46,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:46,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785276882] [2022-07-23 06:39:46,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:46,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:47,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:47,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785276882] [2022-07-23 06:39:47,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785276882] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:47,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391854199] [2022-07-23 06:39:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:47,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:47,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:47,283 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:47,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-23 06:39:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:47,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-23 06:39:47,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:47,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:39:47,396 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:39:47,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:47,434 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 06:39:47,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:47,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:39:47,473 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:47,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-23 06:39:47,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-07-23 06:39:47,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:47,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 25 [2022-07-23 06:39:47,641 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:47,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 24 [2022-07-23 06:39:47,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:47,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:47,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:47,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-07-23 06:39:47,805 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-07-23 06:39:47,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int)) (v_ArrVal_1136 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1136) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-07-23 06:39:47,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:47,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2022-07-23 06:39:47,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 57 [2022-07-23 06:39:47,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:47,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:47,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-23 06:39:47,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391854199] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:47,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:47,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 47 [2022-07-23 06:39:47,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134935570] [2022-07-23 06:39:47,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:47,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-23 06:39:47,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:47,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-23 06:39:47,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1817, Unknown=3, NotChecked=264, Total=2256 [2022-07-23 06:39:47,934 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:48,893 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-07-23 06:39:48,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 06:39:48,893 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-23 06:39:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:48,894 INFO L225 Difference]: With dead ends: 127 [2022-07-23 06:39:48,894 INFO L226 Difference]: Without dead ends: 127 [2022-07-23 06:39:48,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=550, Invalid=3240, Unknown=4, NotChecked=366, Total=4160 [2022-07-23 06:39:48,896 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 539 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:48,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 656 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 987 Invalid, 0 Unknown, 342 Unchecked, 0.4s Time] [2022-07-23 06:39:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-23 06:39:48,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-23 06:39:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 126 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-07-23 06:39:48,898 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 34 [2022-07-23 06:39:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:48,898 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-07-23 06:39:48,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-07-23 06:39:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:39:48,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:48,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:48,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:49,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-23 06:39:49,116 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:49,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:49,116 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2022-07-23 06:39:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:49,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752790840] [2022-07-23 06:39:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:49,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:49,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752790840] [2022-07-23 06:39:49,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752790840] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:49,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027682519] [2022-07-23 06:39:49,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:49,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:49,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:49,329 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:49,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-23 06:39:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:49,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-23 06:39:49,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:49,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:39:49,462 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:49,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:49,481 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:39:49,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-07-23 06:39:49,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:49,543 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:49,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-23 06:39:49,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-23 06:39:49,593 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:39:49,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2022-07-23 06:39:49,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:49,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 16 [2022-07-23 06:39:49,767 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:39:49,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-23 06:39:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:49,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:49,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:50,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2022-07-23 06:39:50,199 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2022-07-23 06:39:50,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2022-07-23 06:39:50,207 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1223) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-23 06:39:50,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:50,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 28 [2022-07-23 06:39:50,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 85 treesize of output 81 [2022-07-23 06:39:50,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 100 treesize of output 96 [2022-07-23 06:39:50,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 107 [2022-07-23 06:39:50,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:50,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 127 treesize of output 131 [2022-07-23 06:39:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-23 06:39:50,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027682519] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:50,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:50,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 37 [2022-07-23 06:39:50,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031953609] [2022-07-23 06:39:50,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:50,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-23 06:39:50,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:50,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-23 06:39:50,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1018, Unknown=4, NotChecked=268, Total=1406 [2022-07-23 06:39:50,318 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 38 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:50,719 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1223) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-23 06:39:51,046 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-23 06:39:51,377 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2022-07-23 06:39:51,712 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-23 06:39:52,037 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from false [2022-07-23 06:39:52,315 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2022-07-23 06:39:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:52,679 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2022-07-23 06:39:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 06:39:52,680 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 38 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-23 06:39:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:52,680 INFO L225 Difference]: With dead ends: 158 [2022-07-23 06:39:52,680 INFO L226 Difference]: Without dead ends: 158 [2022-07-23 06:39:52,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=267, Invalid=1833, Unknown=10, NotChecked=970, Total=3080 [2022-07-23 06:39:52,681 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 255 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:52,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 963 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 447 Invalid, 0 Unknown, 487 Unchecked, 0.2s Time] [2022-07-23 06:39:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-23 06:39:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2022-07-23 06:39:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.1818181818181819) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-07-23 06:39:52,699 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 34 [2022-07-23 06:39:52,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:52,700 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-07-23 06:39:52,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 38 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-07-23 06:39:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:39:52,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:52,700 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] [2022-07-23 06:39:52,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:52,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-23 06:39:52,912 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:52,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:52,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1035188976, now seen corresponding path program 2 times [2022-07-23 06:39:52,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:52,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85592149] [2022-07-23 06:39:52,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:52,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:52,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:52,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85592149] [2022-07-23 06:39:52,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85592149] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:52,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015750973] [2022-07-23 06:39:52,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:39:52,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:52,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:52,944 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:52,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-23 06:39:53,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:39:53,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:39:53,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:39:53,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:53,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:39:53,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015750973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:53,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:39:53,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-07-23 06:39:53,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941549334] [2022-07-23 06:39:53,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:53,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:39:53,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:53,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:39:53,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:39:53,070 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:53,077 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-07-23 06:39:53,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:39:53,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-23 06:39:53,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:53,078 INFO L225 Difference]: With dead ends: 82 [2022-07-23 06:39:53,078 INFO L226 Difference]: Without dead ends: 82 [2022-07-23 06:39:53,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:39:53,078 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 70 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:53,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 100 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:39:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-23 06:39:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-23 06:39:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-07-23 06:39:53,080 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 34 [2022-07-23 06:39:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:53,080 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-07-23 06:39:53,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-07-23 06:39:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:39:53,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:53,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:53,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:53,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-23 06:39:53,292 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:39:53,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:53,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2022-07-23 06:39:53,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:53,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600658928] [2022-07-23 06:39:53,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:53,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:53,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:53,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600658928] [2022-07-23 06:39:53,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600658928] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:53,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155888289] [2022-07-23 06:39:53,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:53,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:53,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:53,636 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:39:53,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-23 06:39:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:53,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-23 06:39:53,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:53,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:39:53,768 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:39:53,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:53,825 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 06:39:53,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:39:53,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:39:53,885 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:53,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-23 06:39:53,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 30 [2022-07-23 06:39:53,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 28 [2022-07-23 06:39:54,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:54,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:54,144 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:54,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 55 [2022-07-23 06:39:54,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-07-23 06:39:54,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-23 06:39:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:39:54,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:55,896 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0))))) is different from false [2022-07-23 06:39:57,837 INFO L356 Elim1Store]: treesize reduction 8, result has 85.5 percent of original size [2022-07-23 06:39:57,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 116 treesize of output 141 [2022-07-23 06:39:57,923 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 (Array Int Int))) (let ((.cse0 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_12))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (<= v_prenex_12 0)) (not (<= 0 v_prenex_12))))) (forall ((v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1409 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1409) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1410) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (or (not (let ((.cse1 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 (+ v_prenex_9 4)) (select .cse1 v_prenex_9)))) (not (<= v_prenex_9 0)) (not (<= 0 v_prenex_9)))) (or (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 (Array Int Int))) (let ((.cse2 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_12))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (or (not (let ((.cse3 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse3 (+ v_prenex_9 4)) (select .cse3 v_prenex_9)))) (not (<= v_prenex_9 0)) (not (<= 0 v_prenex_9)))))) is different from false [2022-07-23 06:39:57,938 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:57,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 105 treesize of output 81 [2022-07-23 06:39:57,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 553 treesize of output 535 [2022-07-23 06:39:57,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 379 treesize of output 363 [2022-07-23 06:39:57,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 200 treesize of output 192 [2022-07-23 06:39:57,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:39:57,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:57,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 735 treesize of output 745 [2022-07-23 06:39:58,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:39:58,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 360 treesize of output 336 [2022-07-23 06:39:58,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:39:58,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 506 treesize of output 458 [2022-07-23 06:39:58,612 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:39:58,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-07-23 06:39:58,616 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:39:58,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 1 [2022-07-23 06:39:58,620 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:39:58,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2022-07-23 06:39:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-23 06:39:58,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155888289] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:58,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:58,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 54 [2022-07-23 06:39:58,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501783927] [2022-07-23 06:39:58,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:58,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-23 06:39:58,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:58,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-23 06:39:58,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2570, Unknown=3, NotChecked=206, Total=2970 [2022-07-23 06:39:58,838 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:39:59,895 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 (Array Int Int))) (let ((.cse0 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_12))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (<= v_prenex_12 0)) (not (<= 0 v_prenex_12))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (forall ((v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1409 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1409) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1410) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (or (not (let ((.cse1 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 (+ v_prenex_9 4)) (select .cse1 v_prenex_9)))) (not (<= v_prenex_9 0)) (not (<= 0 v_prenex_9)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (or (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 (Array Int Int))) (let ((.cse2 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_12))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (or (not (let ((.cse3 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse3 (+ v_prenex_9 4)) (select .cse3 v_prenex_9)))) (not (<= v_prenex_9 0)) (not (<= 0 v_prenex_9))))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-23 06:40:00,786 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-23 06:40:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:01,549 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-07-23 06:40:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 06:40:01,550 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-23 06:40:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:01,550 INFO L225 Difference]: With dead ends: 80 [2022-07-23 06:40:01,550 INFO L226 Difference]: Without dead ends: 80 [2022-07-23 06:40:01,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=391, Invalid=4042, Unknown=5, NotChecked=532, Total=4970 [2022-07-23 06:40:01,561 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 220 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 449 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:01,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 728 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 970 Invalid, 0 Unknown, 449 Unchecked, 0.3s Time] [2022-07-23 06:40:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-23 06:40:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-23 06:40:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:01,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-07-23 06:40:01,565 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 36 [2022-07-23 06:40:01,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:01,565 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-07-23 06:40:01,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:01,565 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-07-23 06:40:01,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 06:40:01,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:01,565 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:01,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-23 06:40:01,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:01,772 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:40:01,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:01,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1472889600, now seen corresponding path program 1 times [2022-07-23 06:40:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:01,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431705994] [2022-07-23 06:40:01,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:40:02,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:02,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431705994] [2022-07-23 06:40:02,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431705994] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:02,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743170036] [2022-07-23 06:40:02,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:02,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:02,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:02,063 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:40:02,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-23 06:40:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:02,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-23 06:40:02,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:02,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:40:02,228 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:02,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:40:02,277 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:40:02,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-07-23 06:40:02,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:40:02,328 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:02,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-23 06:40:02,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-23 06:40:02,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 19 [2022-07-23 06:40:02,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:02,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:02,458 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:02,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2022-07-23 06:40:02,595 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:40:02,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-23 06:40:02,714 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:40:02,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 38 [2022-07-23 06:40:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:40:02,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:02,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 74 [2022-07-23 06:40:03,038 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1502 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))) (forall ((v_ArrVal_1502 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))) is different from false [2022-07-23 06:40:03,046 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1502 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1502 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-23 06:40:03,052 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1501 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1501) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1501 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1501) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-23 06:40:03,057 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:03,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 28 [2022-07-23 06:40:03,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 171 treesize of output 165 [2022-07-23 06:40:03,064 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:03,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 191 treesize of output 193 [2022-07-23 06:40:03,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 224 [2022-07-23 06:40:03,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 250 treesize of output 246 [2022-07-23 06:40:03,098 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:03,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 28 [2022-07-23 06:40:03,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:03,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2022-07-23 06:40:03,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:03,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 48 [2022-07-23 06:40:03,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:03,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-23 06:40:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-23 06:40:03,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743170036] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:03,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:03,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 49 [2022-07-23 06:40:03,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598778449] [2022-07-23 06:40:03,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:03,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 06:40:03,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:03,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 06:40:03,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1969, Unknown=3, NotChecked=276, Total=2450 [2022-07-23 06:40:03,205 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:04,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:04,064 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-07-23 06:40:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 06:40:04,064 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-23 06:40:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:04,064 INFO L225 Difference]: With dead ends: 78 [2022-07-23 06:40:04,064 INFO L226 Difference]: Without dead ends: 78 [2022-07-23 06:40:04,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=486, Invalid=3555, Unknown=3, NotChecked=378, Total=4422 [2022-07-23 06:40:04,066 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 440 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:04,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 566 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 636 Invalid, 0 Unknown, 430 Unchecked, 0.3s Time] [2022-07-23 06:40:04,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-23 06:40:04,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-23 06:40:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-07-23 06:40:04,067 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 37 [2022-07-23 06:40:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:04,067 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-07-23 06:40:04,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:40:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-07-23 06:40:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:40:04,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:04,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:04,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-23 06:40:04,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-23 06:40:04,268 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 06:40:04,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:04,268 INFO L85 PathProgramCache]: Analyzing trace with hash -882633249, now seen corresponding path program 1 times [2022-07-23 06:40:04,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:04,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624597211] [2022-07-23 06:40:04,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:04,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:40:04,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:04,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624597211] [2022-07-23 06:40:04,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624597211] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:04,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791489858] [2022-07-23 06:40:04,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:04,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:04,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:04,872 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:40:04,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-23 06:40:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:04,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-23 06:40:04,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:05,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:40:05,198 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:05,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 53 [2022-07-23 06:40:05,312 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:05,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 48 [2022-07-23 06:40:05,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 46 [2022-07-23 06:40:05,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:05,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:05,628 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:05,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 69 [2022-07-23 06:40:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:40:06,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:08,441 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-07-23 06:40:08,449 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1595 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-07-23 06:40:08,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1595 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0))))) is different from false [2022-07-23 06:40:08,487 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (= (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0)) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-07-23 06:40:08,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:08,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 57 [2022-07-23 06:40:08,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 170 treesize of output 164 [2022-07-23 06:40:08,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:08,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 340 treesize of output 316 [2022-07-23 06:40:08,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:08,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 248 treesize of output 236 [2022-07-23 06:40:08,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:08,527 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:08,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 256 treesize of output 260 [2022-07-23 06:40:17,059 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse673 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse7 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse640 (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse586 (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse587 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse584 (<= .cse673 0))) (let ((.cse464 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse585 (or .cse587 .cse584)) (.cse597 (or .cse640 .cse586)) (.cse598 (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse263 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse675 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse674 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse676 (store .cse675 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse674 (select (store (store .cse675 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse674 (select (store .cse676 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse674 (select (store (store .cse675 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse674 (select (store .cse676 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (.cse31 (not .cse7)) (.cse583 (<= 0 .cse673)) (.cse1 (< .cse673 0)) (.cse2 (< 0 .cse673))) (let ((.cse0 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse671 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse670 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse672 (store .cse671 v_arrayElimCell_197 0))) (or (= .cse670 (select (store (store .cse671 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse670 (select (store .cse672 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse670 (select (store .cse672 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (.cse12 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse666 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse667 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse666 (select (store (store .cse667 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse666 (select (store (store .cse667 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse668 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse669 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse668 (select (store .cse669 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse668 (select (store .cse669 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (.cse13 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse664 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse665 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse664 (select (store (store .cse665 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse664 (select (store (store .cse665 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (.cse11 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse662 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse663 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse662 (select (store .cse663 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse662 (select (store .cse663 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (.cse14 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse15 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse661 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse659 (store .cse661 v_arrayElimCell_195 0)) (.cse658 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse660 (store .cse661 v_arrayElimCell_197 0))) (or (= .cse658 (select (store .cse659 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse658 (select (store .cse659 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse658 (select (store .cse660 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse658 (select (store .cse660 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (.cse163 (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse657 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse656 (store .cse657 v_arrayElimCell_197 0)) (.cse655 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse655 (select (store .cse656 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse655 (select (store .cse656 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse655 (select (store (store .cse657 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse655 (select (store (store .cse657 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse1 .cse2)) (.cse344 (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse653 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse654 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse653 (select (store (store .cse654 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse653 (select (store (store .cse654 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse653 (select (store .cse654 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse1 .cse2)) (.cse231 (and .cse583 .cse584)) (.cse265 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse651 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse650 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse652 (store .cse651 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse650 (select (store (store .cse651 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse650 (select (store .cse652 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse650 (select (store (store .cse651 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse650 (select (store .cse652 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (.cse264 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse649 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse648 (store .cse649 v_arrayElimCell_195 0)) (.cse647 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse647 (select (store .cse648 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse647 (select (store .cse648 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse647 (select (store (store .cse649 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse647 (select (store (store .cse649 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (.cse98 (or .cse263 .cse31)) (.cse266 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse645 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse646 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse645 (select (store (store .cse646 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse645 (select (store (store .cse646 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse645 (select (store (store .cse646 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse228 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (.cse194 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse643 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse644 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse643 (select (store .cse644 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse643 (select (store (store .cse644 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (.cse204 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse203 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse205 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse641 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse642 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse641 (select (store .cse642 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse641 (select (store .cse642 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (.cse273 (and .cse583 (or .cse640 .cse584) .cse598)) (.cse345 (and .cse640 .cse598)) (.cse222 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse638 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse639 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse638 (select (store .cse639 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse638 (select (store .cse639 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (.cse227 (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (.cse223 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse636 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse637 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse636 (select (store .cse637 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse636 (select (store .cse637 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (.cse206 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse635 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse633 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse634 (store .cse635 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse633 (select (store .cse634 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse633 (select (store (store .cse635 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse633 (select (store .cse634 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (.cse210 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse632 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse630 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse631 (store .cse632 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse630 (select (store .cse631 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse630 (select (store (store .cse632 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse630 (select (store .cse631 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (.cse224 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse628 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse629 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse628 (select (store (store .cse629 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse628 (select (store (store .cse629 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (.cse45 (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse627 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse626 (store .cse627 v_arrayElimCell_195 0)) (.cse625 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse625 (select (store .cse626 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse625 (select (store .cse626 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse625 (select (store (store .cse627 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse625 (select (store (store .cse627 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse31)) (.cse290 (not .cse586)) (.cse184 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse624 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse622 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse623 (store .cse624 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse622 (select (store .cse623 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse622 (select (store .cse623 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse622 (select (store (store .cse624 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse622 (select .cse623 v_antiDerIndex_entry0_1))))))) (.cse402 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse620 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse619 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse621 (store .cse620 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse619 (select (store (store .cse620 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse619 (select (store .cse621 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse619 (select (store (store .cse620 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse619 (select .cse621 v_antiDerIndex_entry0_1))))))) (.cse342 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse618 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse616 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse617 (store .cse618 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse616 (select (store .cse617 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse616 (select (store (store .cse618 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse616 (select .cse617 v_antiDerIndex_entry0_1))))))) (.cse287 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse615 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse613 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse614 (store .cse615 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse613 (select (store .cse614 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse613 (select (store (store .cse615 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse613 (select (store .cse614 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse613 (select (store (store .cse615 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse613 (select .cse614 v_antiDerIndex_entry0_1))))))) (.cse405 (or .cse7 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse611 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse612 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse611 (select (store (store .cse612 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse611 (select (store .cse612 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (.cse185 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse610 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse608 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse609 (store .cse610 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse608 (select (store .cse609 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse608 (select (store .cse609 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse608 (select (store (store .cse610 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse608 (select .cse609 v_antiDerIndex_entry0_1))))))) (.cse403 (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse607 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse605 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse606 (store .cse607 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse605 (select (store .cse606 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse605 (select (store (store .cse607 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse605 (select .cse606 v_antiDerIndex_entry0_1))))))) (.cse288 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse604 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse602 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse603 (store .cse604 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse602 (select (store .cse603 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse602 (select (store (store .cse604 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse602 (select (store .cse603 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse602 (select (store (store .cse604 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse602 (select .cse603 v_antiDerIndex_entry0_1))))))) (.cse325 (not .cse587)) (.cse49 (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse601 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse600 (store .cse601 v_arrayElimCell_197 0)) (.cse599 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse599 (select (store .cse600 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse599 (select (store .cse600 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse599 (select (store (store .cse601 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse1 .cse2)) (.cse53 (and .cse585 .cse583 .cse597 .cse598)) (.cse61 (and .cse587 .cse597 .cse598)) (.cse178 (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse595 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse594 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse596 (store .cse595 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse594 (select (store (store .cse595 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse594 (select (store (store .cse595 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse594 (select (store .cse596 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse594 (select .cse596 v_antiDerIndex_entry0_1)))))) .cse31)) (.cse289 (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse592 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse591 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse593 (store .cse592 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse591 (select (store (store .cse592 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse591 (select (store .cse593 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse591 (select (store (store .cse592 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse591 (select (store .cse593 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse591 (select .cse593 v_antiDerIndex_entry0_1)))))) .cse31)) (.cse267 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse590 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse588 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse589 (store .cse590 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse588 (select (store .cse589 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse588 (select (store (store .cse590 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse588 (select (store .cse589 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (.cse99 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse100 (< 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse10 (and .cse587 .cse586)) (.cse6 (and .cse585 .cse583 .cse586)) (.cse225 (not .cse584)) (.cse226 (not .cse583)) (.cse21 (not .cse464))) (and (or (and (or .cse0 .cse1 .cse2) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse5 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse4 (store .cse5 v_arrayElimCell_195 0)) (.cse3 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse3 (select (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse3 (select (store .cse4 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse3 (select (store (store .cse5 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse6) (or .cse7 (and (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse8 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse9 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse8 (select (store .cse9 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse8 (select (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse10) (or .cse6 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (and .cse11 .cse12 .cse13 .cse14) .cse6) (or .cse15 .cse10) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse17 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse16 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse18 (store .cse17 v_arrayElimCell_197 0))) (or (= .cse16 (select (store (store .cse17 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse16 (select (store (store .cse17 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse16 (select (store .cse18 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse16 (select (store .cse18 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse10) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse19 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse20 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse19 (select (store (store .cse20 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse19 (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse19 (select (store (store .cse20 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse6)) .cse21) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_201 Int)) (let ((.cse22 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse23 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse22 (select (store (store .cse23 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse22 (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse22 (select (store .cse23 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse7 .cse6) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse25 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse27 (store .cse25 v_arrayElimCell_197 0)) (.cse24 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse26 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse24 (select (store .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store (store .cse25 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse26 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse27 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse27 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse26 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse29 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse28 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse30 (store .cse29 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse28 (select (store (store .cse29 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse30 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store (store .cse29 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse30 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse31) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse33 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse34 (store .cse33 v_arrayElimCell_195 0)) (.cse35 (store .cse33 v_arrayElimCell_197 0)) (.cse32 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse32 (select (store .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store .cse34 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store .cse34 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store .cse35 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store .cse35 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store (store .cse33 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse37 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse36 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse38 (store .cse37 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse36 (select (store (store .cse37 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse36 (select (store .cse38 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse36 (select (store (store .cse37 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse36 (select (store .cse38 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse31) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse39 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse40 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse39 (select (store (store .cse40 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse39 (select (store (store .cse40 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse39 (select (store (store .cse40 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse31) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse42 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse44 (store .cse42 v_arrayElimCell_197 0)) (.cse41 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse43 (store .cse42 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse41 (select (store .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse41 (select (store (store .cse42 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse41 (select (store .cse43 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse41 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse41 (select (store .cse44 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse41 (select (store .cse43 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse45 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse47 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse48 (store .cse47 v_arrayElimCell_197 0)) (.cse46 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse46 (select (store .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse46 (select (store (store .cse47 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse46 (select (store .cse48 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse46 (select (store .cse48 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse46 (select (store (store .cse47 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse6) (or .cse7 (and .cse49 (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_201 Int)) (let ((.cse52 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse51 (store .cse52 v_arrayElimCell_199 0)) (.cse50 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse50 (select (store .cse51 v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse50 (select (store (store .cse52 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse50 (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse50 (select (store (store .cse52 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)))))) .cse53) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_201 Int)) (let ((.cse56 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse54 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse55 (store .cse56 v_arrayElimCell_199 0))) (or (= .cse54 (select (store .cse55 v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse54 (select (store (store .cse56 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse54 (select (store .cse55 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse53) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_201 Int)) (let ((.cse60 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse59 (store .cse60 v_arrayElimCell_197 0)) (.cse57 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse58 (store .cse60 v_arrayElimCell_199 0))) (or (= .cse57 (select (store .cse58 v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse57 (select (store .cse59 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse57 (select (store .cse59 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse57 (select (store .cse58 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse61) (or .cse53 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse62 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse63 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse62 (select (store .cse63 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse62 (select (store .cse63 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (let ((.cse64 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse65 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse64 (select (store (store .cse65 v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse66 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse67 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse66 (select (store .cse67 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse66 (select (store .cse67 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse64 (select (store (store .cse65 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (let ((.cse68 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse69 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse68 (select (store (store .cse69 v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse68 (select (store (store .cse69 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_201 Int)) (let ((.cse73 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse72 (store .cse73 v_arrayElimCell_197 0)) (.cse71 (store .cse73 v_arrayElimCell_199 0)) (.cse70 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse70 (select (store .cse71 v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse70 (select (store .cse72 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse70 (select (store .cse72 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse70 (select (store .cse71 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse70 (select (store (store .cse73 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)))))) .cse61))) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse75 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse74 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse76 (store .cse75 v_arrayElimCell_197 0))) (or (= .cse74 (select (store (store .cse75 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse74 (select (store .cse76 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse74 (select (store .cse76 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse0 .cse31) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse78 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse77 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse79 (store .cse78 v_arrayElimCell_197 0))) (or (= .cse77 (select (store (store .cse78 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse77 (select (store .cse79 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse80 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse81 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse80 (select (store .cse81 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse81 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse77 (select (store .cse79 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse83 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse82 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse84 (store .cse83 v_arrayElimCell_197 0))) (or (= .cse82 (select (store (store .cse83 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse82 (select (store (store .cse83 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse82 (select (store .cse84 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse85 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse86 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse85 (select (store .cse86 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse85 (select (store .cse86 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse82 (select (store .cse84 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse1 .cse2) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse89 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse87 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse88 (store .cse89 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse87 (select (store .cse88 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse87 (select (store (store .cse89 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse87 (select (store .cse88 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse87 (select (store (store .cse89 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse87 (select (store .cse88 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse92 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse90 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse91 (store .cse92 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse90 (select (store .cse91 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse90 (select (store (store .cse92 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse90 (select (store .cse91 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse90 (select (store (store .cse92 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse93 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse94 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse93 (select (store .cse94 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse93 (select (store .cse94 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse90 (select (store .cse91 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse97 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse95 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse96 (store .cse97 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse95 (select (store .cse96 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse95 (select (store (store .cse97 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse95 (select (store .cse96 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse95 (select (store (store .cse97 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse95 (select (store .cse96 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse98) .cse99 .cse100) (or (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse101 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse102 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse101 (select (store .cse102 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse101 (select (store (store .cse102 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse101 (select (store (store .cse102 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse103 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse104 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse103 (select (store .cse104 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse103 (select (store .cse104 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse107 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse106 (store .cse107 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse105 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse105 (select (store .cse106 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse105 (select .cse106 v_antiDerIndex_entry0_1)) (= .cse105 (select (store (store .cse107 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse108 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse109 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse108 (select (store .cse109 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse109 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse110 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse111 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse110 (select (store .cse111 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse110 (select (store (store .cse111 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse110 (select (store (store .cse111 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (and .cse12 .cse13) .cse31) (or (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse112 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse113 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse112 (select (store .cse113 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse112 (select (store .cse113 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse114 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse115 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse114 (select (store .cse115 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse114 (select (store .cse115 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse116 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse117 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse116 (select (store .cse117 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse116 (select (store .cse117 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse31) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse119 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse118 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse120 (store .cse119 v_arrayElimCell_195 0))) (or (= .cse118 (select (store .cse119 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse120 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse120 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (or (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse121 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse122 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse121 (select (store (store .cse122 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse121 (select (store (store .cse122 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse123 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse124 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse123 (select (store (store .cse124 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse123 (select (store (store .cse124 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse125 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse126 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse125 (select (store .cse126 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse125 (select (store .cse126 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) .cse31) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse127 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse128 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse127 (select (store .cse128 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse127 (select (store (store .cse128 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse129 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse130 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse129 (select (store .cse130 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse129 (select (store (store .cse130 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse131 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse132 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse131 (select (store .cse132 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse131 (select (store .cse132 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse134 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse133 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse135 (store .cse134 v_arrayElimCell_195 0))) (or (= .cse133 (select (store .cse134 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store .cse135 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store .cse135 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse136 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse137 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse136 (select (store .cse137 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse136 (select (store .cse137 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (or (and .cse11 .cse14) .cse31) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse138 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse139 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse138 (select (store .cse139 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse138 (select (store (store .cse139 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse138 (select (store (store .cse139 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse142 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse141 (store .cse142 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse140 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse140 (select (store .cse141 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse140 (select .cse141 v_antiDerIndex_entry0_1)) (= .cse140 (select (store (store .cse142 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse143 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse144 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse143 (select (store .cse144 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse143 (select (store (store .cse144 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse143 (select (store (store .cse144 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse145 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse146 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse145 (select (store .cse146 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse145 (select (store .cse146 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) .cse6) (or (and (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse149 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse150 (store .cse149 v_arrayElimCell_197 0)) (.cse147 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse148 (store .cse149 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse147 (select (store .cse148 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse147 (select (store (store .cse149 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse147 (select (store .cse150 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse147 (select (store .cse150 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse147 (select (store .cse148 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse53) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse152 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse153 (store .cse152 v_arrayElimCell_197 0)) (.cse151 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse151 (select (store (store .cse152 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store .cse153 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store .cse153 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store (store .cse152 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse53) (or .cse61 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse158 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse157 (store .cse158 v_arrayElimCell_197 0)) (.cse156 (store .cse158 v_arrayElimCell_199 0)) (.cse154 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse155 (store .cse158 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse154 (select (store .cse155 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse154 (select (store .cse156 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse154 (select (store .cse157 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse154 (select (store .cse157 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse154 (select (store .cse156 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse154 (select (store .cse155 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse162 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse161 (store .cse162 v_arrayElimCell_197 0)) (.cse160 (store .cse162 v_arrayElimCell_199 0)) (.cse159 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse159 (select (store .cse160 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store .cse161 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store .cse161 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store .cse160 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store (store .cse162 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse61) .cse163) .cse7) (or .cse7 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_201 Int)) (let ((.cse164 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse165 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse164 (select (store (store .cse165 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse164 (select (store (store .cse165 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse164 (select (store (store .cse165 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse6) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse166 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse167 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse166 (select (store (store .cse167 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse166 (select (store (store .cse167 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse166 (select (store .cse167 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse168 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse169 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse168 (select (store (store .cse169 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse168 (select (store (store .cse169 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse168 (select (store .cse169 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse172 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse170 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse171 (store .cse172 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse170 (select (store .cse171 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse170 (select (store (store .cse172 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse170 (select (store (store .cse172 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse170 (select .cse171 v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse174 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse173 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse175 (store .cse174 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse173 (select (store (store .cse174 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse173 (select (store (store .cse174 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse173 (select (store .cse175 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse173 (select .cse175 v_antiDerIndex_entry0_1)))))) .cse31)) .cse1 .cse2) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse176 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse177 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse176 (select (store (store .cse177 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse176 (select (store (store .cse177 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse176 (select (store .cse177 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse178 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse181 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse179 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse180 (store .cse181 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse179 (select (store .cse180 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store (store .cse181 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store (store .cse181 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse179 (select .cse180 v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse182 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse183 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse182 (select (store (store .cse183 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse182 (select (store (store .cse183 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse182 (select (store .cse183 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse1 .cse2) (or (and .cse184 .cse185 (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse188 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse186 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse187 (store .cse188 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse186 (select (store .cse187 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store (store .cse188 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store .cse187 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse186 (select .cse187 v_antiDerIndex_entry0_1)))))) .cse31)) .cse99 .cse100) (or (let ((.cse195 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse234 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse235 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse234 (select (store (store .cse235 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse234 (select (store (store .cse235 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (.cse193 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse232 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse233 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse232 (select (store .cse233 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse232 (select (store .cse233 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (and (or (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse189 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse190 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse189 (select (store (store .cse190 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse189 (select (store (store .cse190 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse191 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse192 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse191 (select (store .cse192 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse191 (select (store (store .cse192 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse191 (select (store (store .cse192 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) .cse193 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) .cse194 .cse195 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse196 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse197 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse196 (select (store .cse197 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse196 (select (store (store .cse197 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse196 (select (store (store .cse197 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse199 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse198 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse200 (store .cse199 v_arrayElimCell_195 0))) (or (= .cse198 (select (store .cse199 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse198 (select (store .cse200 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse198 (select (store .cse200 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) .cse6) (or (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse201 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse202 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse201 (select (store (store .cse202 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store (store .cse202 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse203 .cse204 .cse205) .cse1 .cse2) (or (and .cse206 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse209 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse207 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse208 (store .cse209 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse207 (select (store .cse208 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store (store .cse209 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store .cse208 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse210 .cse195) .cse99 .cse100) (or (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse211 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse212 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse211 (select (store .cse212 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse211 (select (store .cse212 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse213 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse214 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse213 (select (store .cse214 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse213 (select (store .cse214 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse193 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse216 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse215 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse217 (store .cse216 v_arrayElimCell_195 0))) (or (= .cse215 (select (store (store .cse216 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse217 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse217 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse218 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse219 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse218 (select (store .cse219 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse218 (select (store .cse219 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse1 .cse2) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse220 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse221 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse220 (select (store .cse221 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse220 (select (store .cse221 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse222 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) .cse223) .cse99 .cse100) (or .cse21 (and .cse224 (or .cse225 .cse203 .cse226) (or .cse227 .cse99 .cse100) (or .cse6 .cse228) (or .cse193 .cse10) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse229 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse230 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse229 (select (store (store .cse230 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse229 (select (store (store .cse230 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) .cse231))))) .cse31) (or (and (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse237 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse236 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse238 (store .cse237 v_arrayElimCell_197 0))) (or (= .cse236 (select (store .cse237 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse236 (select (store .cse238 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse236 (select (store .cse238 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse10) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse240 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse239 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse241 (store .cse240 v_arrayElimCell_197 0))) (or (= .cse239 (select (store (store .cse240 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse239 (select (store .cse241 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse239 (select (store .cse241 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse1 .cse2) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse244 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse243 (store .cse244 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse242 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse242 (select (store .cse243 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse242 (select .cse243 v_antiDerIndex_entry0_1)) (= .cse242 (select (store (store .cse244 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse6) (or .cse6 (and (forall ((v_antiDerIndex_entry0_1 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse245 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse246 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse245 (select (store .cse246 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse246 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))))) .cse7) (or (and (or .cse15 .cse31) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse250 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse248 (store .cse250 v_arrayElimCell_195 0)) (.cse247 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse249 (store .cse250 v_arrayElimCell_197 0))) (or (= .cse247 (select (store .cse248 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse247 (select (store .cse248 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse247 (select (store .cse249 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse247 (select (store .cse249 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse252 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse253 (store .cse252 v_arrayElimCell_195 0)) (.cse251 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse254 (store .cse252 v_arrayElimCell_197 0))) (or (= .cse251 (select (store (store .cse252 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse251 (select (store .cse253 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse251 (select (store .cse253 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse251 (select (store .cse254 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse255 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse256 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse255 (select (store .cse256 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse255 (select (store .cse256 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse251 (select (store .cse254 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse262 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse258 (store .cse262 v_arrayElimCell_195 0)) (.cse257 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse259 (store .cse262 v_arrayElimCell_197 0))) (or (= .cse257 (select (store .cse258 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse258 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse259 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse260 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse261 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse260 (select (store .cse261 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse260 (select (store .cse261 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse257 (select (store .cse259 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse1 .cse2) (or (and (or .cse231 .cse263) (or .cse264 .cse6) (or .cse231 .cse265) (or .cse263 .cse99 .cse100) (or .cse266 .cse6) (or .cse267 .cse99 .cse100) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse268 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse269 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse268 (select (store (store .cse269 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse268 (select (store (store .cse269 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse7 .cse231)) .cse21) (or .cse7 (and (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse272 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse270 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse271 (store .cse272 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse270 (select (store .cse271 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse270 (select (store (store .cse272 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse270 (select (store (store .cse272 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse270 (select (store .cse271 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse273) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse274 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse275 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse274 (select (store (store .cse275 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse274 (select (store (store .cse275 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse276 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse277 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse276 (select (store (store .cse277 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse278 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse279 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse278 (select (store .cse279 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse278 (select (store .cse279 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse276 (select (store (store .cse277 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse53) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse282 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse280 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse281 (store .cse282 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse280 (select (store .cse281 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse280 (select (store (store .cse282 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse280 (select (store .cse281 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse99 .cse100) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse286 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse285 (store .cse286 v_arrayElimCell_199 0)) (.cse283 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse284 (store .cse286 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse283 (select (store .cse284 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store .cse285 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store (store .cse286 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store .cse285 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store .cse284 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse273))) (or (and .cse287 .cse288 .cse289) .cse99 .cse100) (or .cse290 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse291 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse292 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse291 (select (store .cse292 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse291 (select (store .cse292 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse291 (select (store .cse292 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse293 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse294 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse293 (select (store .cse294 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse293 (select (store .cse294 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse295 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse296 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse295 (select (store .cse296 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse295 (select (store .cse296 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse293 (select (store .cse294 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse297 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse298 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse297 (select (store .cse298 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse297 (select (store .cse298 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse299 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse300 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse299 (select (store .cse300 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse301 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse302 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse301 (select (store .cse302 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse301 (select (store .cse302 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse299 (select (store .cse300 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse303 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse304 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse303 (select (store .cse304 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse303 (select (store .cse304 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse7) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse307 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse305 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse306 (store .cse307 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse305 (select (store .cse306 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse305 (select (store (store .cse307 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse305 (select (store .cse306 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse305 (select (store .cse306 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse309 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse308 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse310 (store .cse309 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse308 (select (store (store .cse309 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse308 (select (store .cse310 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse308 (select (store .cse310 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse31) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse313 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse311 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse312 (store .cse313 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse311 (select (store .cse312 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse311 (select (store (store .cse313 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse311 (select (store .cse312 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse314 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse315 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse314 (select (store .cse315 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store .cse315 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse311 (select (store .cse312 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse316 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse317 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse316 (select (store .cse317 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse317 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse317 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse318 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse319 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse318 (select (store .cse319 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse318 (select (store .cse319 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse31) (or .cse21 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (or (forall ((v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) .cse7) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse320 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse321 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse320 (select (store (store .cse321 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse320 (select (store (store .cse321 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (or (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse324 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse322 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse323 (store .cse324 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse322 (select (store .cse323 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse322 (select (store (store .cse324 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse322 (select (store .cse323 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse322 (select (store .cse323 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse325) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse328 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse329 (store .cse328 v_arrayElimCell_197 0)) (.cse326 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse327 (store .cse328 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse326 (select (store .cse327 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse326 (select (store (store .cse328 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse326 (select (store .cse329 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse330 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse331 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse330 (select (store .cse331 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse330 (select (store .cse331 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse326 (select (store .cse329 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse326 (select (store .cse327 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse333 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse334 (store .cse333 v_arrayElimCell_197 0)) (.cse332 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse332 (select (store (store .cse333 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse332 (select (store .cse334 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse332 (select (store .cse334 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse332 (select (store (store .cse333 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse336 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse337 (store .cse336 v_arrayElimCell_197 0)) (.cse335 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse335 (select (store (store .cse336 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse335 (select (store .cse337 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse338 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse339 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse338 (select (store .cse339 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse338 (select (store .cse339 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse335 (select (store .cse337 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse335 (select (store (store .cse336 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse340 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse341 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse340 (select (store (store .cse341 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse340 (select (store (store .cse341 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse340 (select (store (store .cse341 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse31)) .cse1 .cse2) (or .cse7 (let ((.cse343 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse346 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse347 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse346 (select (store (store .cse347 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse346 (select (store (store .cse347 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse346 (select (store .cse347 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (and (or .cse342 .cse99 .cse100) (or .cse61 .cse343) (or .cse343 .cse273) (or .cse343 .cse53) .cse344 (or .cse345 .cse343)))) (or .cse7 (and (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse352 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse349 (store .cse352 v_arrayElimCell_197 0)) (.cse348 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse348 (select (store .cse349 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (let ((.cse350 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse351 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse350 (select (store (store .cse351 v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse350 (select (store (store .cse351 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))) (= .cse348 (select (store .cse349 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse348 (select (store (store .cse352 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse355 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse354 (store .cse355 v_arrayElimCell_197 0)) (.cse353 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse353 (select (store .cse354 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))) (= .cse353 (select (store .cse354 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse353 (select (store (store .cse355 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse53) (or .cse61 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_201 Int)) (let ((.cse360 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse358 (store .cse360 v_arrayElimCell_197 0)) (.cse357 (store .cse360 v_arrayElimCell_199 0)) (.cse356 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse359 (store .cse360 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse356 (select (store .cse357 v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store .cse358 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store .cse358 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store .cse357 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store .cse359 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store .cse359 v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))))) .cse163 (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_201 Int)) (let ((.cse364 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse363 (store .cse364 v_arrayElimCell_197 0)) (.cse362 (store .cse364 v_arrayElimCell_199 0)) (.cse361 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse361 (select (store .cse362 v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse361 (select (store .cse363 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse361 (select (store .cse363 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse361 (select (store .cse362 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse361 (select (store (store .cse364 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse61))) (or .cse7 .cse6 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse365 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse366 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse365 (select (store .cse366 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse365 (select (store (store .cse366 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse365 (select (store (store .cse366 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (let ((.cse367 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_201 Int)) (let ((.cse368 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse369 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse368 (select (store (store .cse369 v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse368 (select (store (store .cse369 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse368 (select (store .cse369 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (and (or .cse53 .cse367) (or .cse61 .cse367) .cse344)) .cse7) (or .cse7 .cse6 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_201 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse370 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse371 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse370 (select (store .cse371 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse370 (select (store .cse371 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_201 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (or (and (or .cse7 .cse10 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse374 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse373 (store .cse374 v_arrayElimCell_197 0)) (.cse372 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse372 (select (store .cse373 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse372 (select (store .cse373 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse372 (select (store (store .cse374 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse378 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse376 (store .cse378 v_arrayElimCell_195 0)) (.cse377 (store .cse378 v_arrayElimCell_197 0)) (.cse375 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse375 (select (store .cse376 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store .cse376 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store .cse377 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store .cse377 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store (store .cse378 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse10) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse381 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse380 (store .cse381 v_arrayElimCell_197 0)) (.cse379 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse379 (select (store .cse380 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse379 (select (store .cse380 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse379 (select (store (store .cse381 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse386 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse385 (store .cse386 v_arrayElimCell_197 0)) (.cse384 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse382 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse383 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse382 (select (store (store .cse383 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse382 (select (store (store .cse383 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse384 (select (store .cse385 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse384 (select (store .cse385 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse384 (select (store (store .cse386 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse6) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse388 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse389 (store .cse388 v_arrayElimCell_197 0)) (.cse387 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse387 (select (store (store .cse388 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse387 (select (store .cse389 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse387 (select (store .cse389 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse387 (select (store (store .cse388 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse1 .cse2) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse391 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse393 (store .cse391 v_arrayElimCell_197 0)) (.cse390 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse392 (store .cse391 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse390 (select (store (store .cse391 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse390 (select (store .cse392 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse390 (select (store .cse393 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse390 (select (store .cse393 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse390 (select (store .cse392 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse10)) .cse21) (or (and (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse395 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse396 (store .cse395 v_arrayElimCell_197 0)) (.cse394 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse394 (select (store .cse395 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse394 (select (store .cse396 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse394 (select (store .cse396 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse394 (select (store (store .cse395 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse10) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse398 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse399 (store .cse398 v_arrayElimCell_197 0)) (.cse397 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse397 (select (store (store .cse398 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse397 (select (store .cse399 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse397 (select (store .cse399 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse397 (select (store (store .cse398 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse1 .cse2)) .cse7) (or (let ((.cse404 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse406 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse407 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse406 (select (store (store .cse407 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse406 (select (store (store .cse407 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse406 (select (store .cse407 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (and (or .cse225 .cse226 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse400 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse401 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse400 (select (store (store .cse401 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse400 (select (store (store .cse401 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse400 (select (store .cse401 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse402 (or .cse99 .cse403 .cse100) (or .cse404 .cse10) (or .cse231 .cse404) .cse405 (or .cse6 .cse404))) .cse21) (or .cse7 (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse408 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse409 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse408 (select (store (store .cse409 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))) (= .cse408 (select (store (store .cse409 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse410 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse411 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse410 (select (store (store .cse411 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (let ((.cse412 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse413 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse412 (select (store (store .cse413 v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse412 (select (store (store .cse413 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))) (= .cse410 (select (store (store .cse411 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse414 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse415 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse414 (select (store (store .cse415 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse414 (select (store (store .cse415 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_201 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse418 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse419 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_201 Int)) (let ((.cse416 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse417 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse416 (select (store (store .cse417 v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse416 (select (store (store .cse417 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))))) (= .cse418 (select (store (store .cse419 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse418 (select (store (store .cse419 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse53) (or .cse6 (and (or .cse265 .cse31) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse421 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse420 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse422 (store .cse421 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse420 (select (store .cse421 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse420 (select (store (store .cse421 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse420 (select (store .cse422 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse420 (select (store (store .cse421 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse420 (select (store .cse422 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse264 .cse31) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse424 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse425 (store .cse424 v_arrayElimCell_195 0)) (.cse423 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse423 (select (store .cse424 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse423 (select (store .cse425 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse423 (select (store .cse425 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse423 (select (store (store .cse424 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse423 (select (store (store .cse424 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse427 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse426 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse428 (store .cse427 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse426 (select (store .cse427 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store (store .cse427 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store .cse428 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store (store .cse427 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store .cse428 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse98 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse429 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse430 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse429 (select (store .cse430 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse429 (select (store (store .cse430 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse429 (select (store (store .cse430 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse429 (select (store (store .cse430 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or .cse266 .cse31))) (or (let ((.cse440 (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse1 .cse2))) (and (or .cse7 (and (or .cse225 .cse226 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse431 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse432 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) (or (= .cse431 (select (store .cse432 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse431 (select .cse432 v_antiDerIndex_entry0_1))))) .cse10) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse6))) (or (and (or .cse228 .cse31) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse435 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse434 (store .cse435 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse433 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse433 (select (store .cse434 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse433 (select .cse434 v_antiDerIndex_entry0_1)) (= .cse433 (select (store (store .cse435 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) .cse194) .cse6) (or .cse1 (and .cse204 (or .cse203 .cse31) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse436 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse437 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse436 (select (store (store .cse437 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse436 (select (store (store .cse437 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse438 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse439 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse438 (select (store .cse439 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse438 (select (store .cse439 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse205) .cse2) (or (and .cse440 (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse441 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse442 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse441 (select (store (store .cse442 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse441 (select (store (store .cse442 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse273) (or .cse61 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse443 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse444 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse443 (select (store .cse444 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse443 (select (store .cse444 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse99 .cse100) (or .cse345 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse446 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse445 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse447 (store .cse446 v_arrayElimCell_199 0))) (or (= .cse445 (select (store (store .cse446 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse445 (select (store .cse447 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse445 (select (store .cse447 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or .cse53 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse7) (or .cse7 (and .cse440 (or .cse53 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (let ((.cse448 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse449 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse448 (select (store (store .cse449 v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse448 (select (store (store .cse449 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (let ((.cse450 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse451 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse450 (select (store .cse451 v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse450 (select (store .cse451 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse61) (or .cse61 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (let ((.cse454 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse453 (store .cse454 v_arrayElimCell_199 0)) (.cse452 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse452 (select (store .cse453 v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse452 (select (store .cse453 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse452 (select (store (store .cse454 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))))))) (or .cse99 .cse100 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse455 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse456 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse455 (select (store .cse456 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse455 (select (store .cse456 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse457 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse458 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse457 (select (store .cse458 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse457 (select (store .cse458 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse222 (or .cse227 .cse31) .cse223)) (or (and .cse206 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse461 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse459 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse460 (store .cse461 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse459 (select (store .cse460 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse459 (select (store (store .cse461 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse459 (select (store .cse460 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse462 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse463 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse462 (select (store .cse463 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse462 (select (store .cse463 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) .cse210 (or .cse224 .cse31)) .cse99 .cse100) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_201 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))) .cse7 .cse6))) .cse464) (or .cse1 (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse468 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse466 (store .cse468 v_arrayElimCell_195 0)) (.cse467 (store .cse468 v_arrayElimCell_197 0)) (.cse465 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse465 (select (store .cse466 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse465 (select (store .cse466 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse465 (select (store .cse467 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse465 (select (store .cse467 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse465 (select (store (store .cse468 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse45 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse475 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse471 (store .cse475 v_arrayElimCell_195 0)) (.cse472 (store .cse475 v_arrayElimCell_197 0)) (.cse469 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse470 (store .cse475 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse469 (select (store .cse470 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store .cse471 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store .cse471 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store .cse472 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse473 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse474 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse473 (select (store .cse474 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse473 (select (store .cse474 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse469 (select (store .cse472 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store .cse470 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse481 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse477 (store .cse481 v_arrayElimCell_195 0)) (.cse478 (store .cse481 v_arrayElimCell_197 0)) (.cse476 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse476 (select (store .cse477 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse476 (select (store .cse477 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse476 (select (store .cse478 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse479 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse480 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse479 (select (store .cse480 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse479 (select (store .cse480 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse476 (select (store .cse478 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse476 (select (store (store .cse481 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse2) (or .cse7 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_201 Int)) (let ((.cse484 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse483 (store .cse484 v_arrayElimCell_197 0)) (.cse482 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse482 (select (store .cse483 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse482 (select (store (store .cse484 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse482 (select (store .cse483 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse482 (select (store (store .cse484 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse6) (or .cse290 (and .cse184 (or .cse402 .cse31) (or (and .cse342 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse487 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse485 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse486 (store .cse487 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse485 (select (store .cse486 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse485 (select (store (store .cse487 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse485 (select .cse486 v_antiDerIndex_entry0_1))))))) .cse7) .cse287 (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse488 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse489 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse488 (select (store (store .cse489 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse488 (select (store .cse489 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse490 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse491 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse490 (select (store (store .cse491 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse490 (select (store .cse491 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse492 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse493 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse492 (select (store (store .cse493 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse492 (select (store .cse493 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse405) .cse21) .cse185 (or .cse403 .cse31) .cse288) .cse325) (or .cse7 (and .cse49 (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse496 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse494 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse495 (store .cse496 v_arrayElimCell_199 0))) (or (= .cse494 (select (store .cse495 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse494 (select (store (store .cse496 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse494 (select (store .cse495 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse53) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse497 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse498 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse497 (select (store .cse498 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse497 (select (store .cse498 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse53) (or .cse61 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse502 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse501 (store .cse502 v_arrayElimCell_197 0)) (.cse499 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse500 (store .cse502 v_arrayElimCell_199 0))) (or (= .cse499 (select (store .cse500 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse499 (select (store .cse501 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse499 (select (store .cse501 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse499 (select (store .cse500 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse503 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse504 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse503 (select (store (store .cse504 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse503 (select (store (store .cse504 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse505 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse506 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse505 (select (store .cse506 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse505 (select (store .cse506 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse507 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse508 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse507 (select (store (store .cse508 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse507 (select (store (store .cse508 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse53) (or .cse53 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse510 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse509 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse511 (store .cse510 v_arrayElimCell_199 0))) (or (= .cse509 (select (store (store .cse510 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse509 (select (store .cse511 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse509 (select (store (store .cse510 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse509 (select (store .cse511 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse513 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse515 (store .cse513 v_arrayElimCell_197 0)) (.cse512 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse514 (store .cse513 v_arrayElimCell_199 0))) (or (= .cse512 (select (store (store .cse513 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse512 (select (store .cse514 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse512 (select (store .cse515 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse512 (select (store .cse515 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse512 (select (store .cse514 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse61))) (or .cse6 (and (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse517 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse516 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse518 (store .cse517 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse516 (select (store (store .cse517 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse516 (select (store (store .cse517 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse516 (select (store .cse518 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse516 (select .cse518 v_antiDerIndex_entry0_1)))))) .cse31) .cse178 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse520 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse519 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse521 (store .cse520 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse519 (select (store .cse520 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse519 (select (store (store .cse520 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse519 (select (store .cse521 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse519 (select (store (store .cse520 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse519 (select .cse521 v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse522 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse523 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse522 (select (store .cse523 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse522 (select (store (store .cse523 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse522 (select (store (store .cse523 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse522 (select (store .cse523 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse289)) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse526 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse524 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse525 (store .cse526 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse524 (select (store .cse525 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse524 (select (store .cse525 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse524 (select (store (store .cse526 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse524 (select (store .cse525 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse529 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse527 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse528 (store .cse529 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse527 (select (store .cse528 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse527 (select (store .cse528 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse527 (select (store (store .cse529 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse527 (select (store .cse528 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse532 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse530 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse531 (store .cse532 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse530 (select (store .cse531 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse530 (select (store .cse531 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse530 (select (store (store .cse532 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse533 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse534 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse533 (select (store .cse534 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse533 (select (store .cse534 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse530 (select (store .cse531 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse267 .cse31)) .cse99 .cse100) (or .cse7 (let ((.cse535 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse538 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse539 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse538 (select (store .cse539 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse538 (select (store (store .cse539 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse538 (select (store .cse539 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (and (or .cse535 .cse10) (or .cse535 .cse6) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse536 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse537 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse536 (select (store (store .cse537 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse536 (select (store (store .cse537 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse536 (select (store .cse537 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse225 .cse226)))) (or .cse225 .cse226 (let ((.cse553 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (and (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse540 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse541 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse540 (select (store .cse541 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse540 (select (store .cse541 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse7)) .cse21) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse544 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse543 (store .cse544 v_arrayElimCell_195 0)) (.cse542 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse542 (select (store .cse543 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse542 (select (store .cse543 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse542 (select (store (store .cse544 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse7 (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse545 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse546 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse545 (select (store (store .cse546 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse545 (select (store (store .cse546 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse547 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse548 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse547 (select (store .cse548 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse547 (select (store (store .cse548 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse549 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse550 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse549 (select (store (store .cse550 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse551 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse552 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse551 (select (store .cse552 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse551 (select (store .cse552 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse549 (select (store (store .cse550 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse553 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (or (forall ((v_arrayElimCell_199 Int)) (let ((.cse554 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse555 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse554 (select (store .cse555 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse554 (select (store .cse555 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse7) (or .cse7 (and .cse553 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_201 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (or (forall ((v_arrayElimCell_199 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_201 Int)) (let ((.cse556 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse557 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse556 (select (store (store .cse557 v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1)) (= .cse556 (select (store (store .cse557 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse559 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse560 (store .cse559 v_arrayElimCell_195 0)) (.cse558 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse558 (select (store (store .cse559 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse558 (select (store .cse560 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse558 (select (store .cse560 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse561 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse562 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse561 (select (store .cse562 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse561 (select (store .cse562 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse558 (select (store (store .cse559 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse567 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse564 (store .cse567 v_arrayElimCell_195 0)) (.cse563 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse563 (select (store .cse564 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse563 (select (store .cse564 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse565 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse566 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse565 (select (store .cse566 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse565 (select (store .cse566 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse563 (select (store (store .cse567 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse568 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse569 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse568 (select (store (store .cse569 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse568 (select (store (store .cse569 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse570 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse571 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse570 (select (store .cse571 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse570 (select (store .cse571 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse568 (select (store (store .cse569 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse572 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse573 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse572 (select (store (store .cse573 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse572 (select (store (store .cse573 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse31) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse574 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse575 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse574 (select (store (store .cse575 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse576 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse577 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse576 (select (store .cse577 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse576 (select (store .cse577 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse574 (select (store (store .cse575 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse578 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse579 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse578 (select (store (store .cse579 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse578 (select (store (store .cse579 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse582 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse581 (store .cse582 v_arrayElimCell_195 0)) (.cse580 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse580 (select (store .cse581 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse580 (select (store .cse581 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse580 (select (store (store .cse582 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse31))))))))) is different from false [2022-07-23 06:42:12,630 WARN L233 SmtUtils]: Spent 1.13m on a formula simplification. DAG size of input: 343 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:42:24,944 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:42:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-23 06:42:27,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791489858] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:42:27,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:42:27,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 20] total 58 [2022-07-23 06:42:27,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756528484] [2022-07-23 06:42:27,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:42:27,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-23 06:42:27,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:27,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-23 06:42:27,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2690, Unknown=27, NotChecked=540, Total=3422 [2022-07-23 06:42:27,479 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 59 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 59 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)