./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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/memsafety-ext/tree_cnstr.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 ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:59:16,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:59:16,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:59:16,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:59:16,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:59:16,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:59:16,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:59:16,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:59:16,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:59:16,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:59:16,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:59:16,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:59:16,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:59:16,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:59:16,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:59:16,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:59:16,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:59:16,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:59:16,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:59:16,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:59:16,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:59:16,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:59:16,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:59:16,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:59:16,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:59:16,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:59:16,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:59:16,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:59:16,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:59:16,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:59:16,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:59:16,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:59:16,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:59:16,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:59:16,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:59:16,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:59:16,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:59:16,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:59:16,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:59:16,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:59:16,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:59:16,697 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 21:59:16,724 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:59:16,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:59:16,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:59:16,725 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:59:16,725 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:59:16,725 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:59:16,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:59:16,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:59:16,726 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:59:16,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:59:16,727 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:59:16,727 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 21:59:16,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:59:16,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:59:16,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:59:16,728 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 21:59:16,728 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 21:59:16,728 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 21:59:16,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:59:16,729 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 21:59:16,729 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:59:16,729 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:59:16,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:59:16,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:59:16,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:59:16,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:59:16,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:59:16,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:59:16,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 21:59:16,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 21:59:16,731 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:59:16,731 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:59:16,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:59:16,731 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:59:16,732 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d [2023-02-15 21:59:16,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:59:16,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:59:16,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:59:16,966 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:59:16,966 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:59:16,967 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2023-02-15 21:59:18,052 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:59:18,299 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:59:18,299 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2023-02-15 21:59:18,315 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8bbb09ae/cc272b1eef974ec8a33b291022f73b74/FLAG5d14aed73 [2023-02-15 21:59:18,325 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8bbb09ae/cc272b1eef974ec8a33b291022f73b74 [2023-02-15 21:59:18,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:59:18,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:59:18,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:59:18,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:59:18,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:59:18,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:59:18" (1/1) ... [2023-02-15 21:59:18,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca5e08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18, skipping insertion in model container [2023-02-15 21:59:18,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:59:18" (1/1) ... [2023-02-15 21:59:18,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:59:18,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:59:18,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:59:18,579 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 21:59:18,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:59:18,657 INFO L208 MainTranslator]: Completed translation [2023-02-15 21:59:18,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18 WrapperNode [2023-02-15 21:59:18,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:59:18,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 21:59:18,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 21:59:18,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 21:59:18,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18" (1/1) ... [2023-02-15 21:59:18,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18" (1/1) ... [2023-02-15 21:59:18,719 INFO L138 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2023-02-15 21:59:18,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 21:59:18,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 21:59:18,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 21:59:18,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 21:59:18,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18" (1/1) ... [2023-02-15 21:59:18,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18" (1/1) ... [2023-02-15 21:59:18,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18" (1/1) ... [2023-02-15 21:59:18,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18" (1/1) ... [2023-02-15 21:59:18,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18" (1/1) ... [2023-02-15 21:59:18,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18" (1/1) ... [2023-02-15 21:59:18,772 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18" (1/1) ... [2023-02-15 21:59:18,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18" (1/1) ... [2023-02-15 21:59:18,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 21:59:18,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 21:59:18,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 21:59:18,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 21:59:18,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18" (1/1) ... [2023-02-15 21:59:18,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:59:18,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:59:18,812 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) [2023-02-15 21:59:18,814 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 [2023-02-15 21:59:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 21:59:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 21:59:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 21:59:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 21:59:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 21:59:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 21:59:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 21:59:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 21:59:18,985 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 21:59:18,987 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 21:59:19,443 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 21:59:19,454 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 21:59:19,454 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 21:59:19,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:59:19 BoogieIcfgContainer [2023-02-15 21:59:19,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 21:59:19,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 21:59:19,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 21:59:19,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 21:59:19,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:59:18" (1/3) ... [2023-02-15 21:59:19,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723d3242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:59:19, skipping insertion in model container [2023-02-15 21:59:19,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:18" (2/3) ... [2023-02-15 21:59:19,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723d3242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:59:19, skipping insertion in model container [2023-02-15 21:59:19,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:59:19" (3/3) ... [2023-02-15 21:59:19,465 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_cnstr.i [2023-02-15 21:59:19,485 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 21:59:19,485 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2023-02-15 21:59:19,557 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 21:59:19,563 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c8a92f5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 21:59:19,564 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-02-15 21:59:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 66 states have (on average 2.121212121212121) internal successors, (140), 122 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) [2023-02-15 21:59:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 21:59:19,572 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:19,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 21:59:19,573 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:19,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:19,579 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 21:59:19,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:19,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731771743] [2023-02-15 21:59:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:19,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:19,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731771743] [2023-02-15 21:59:19,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731771743] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:19,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:19,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:59:19,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602970621] [2023-02-15 21:59:19,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:19,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:59:19,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:19,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:59:19,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:19,816 INFO L87 Difference]: Start difference. First operand has 123 states, 66 states have (on average 2.121212121212121) internal successors, (140), 122 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-02-15 21:59:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:19,984 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2023-02-15 21:59:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:59:19,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2023-02-15 21:59:19,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:19,994 INFO L225 Difference]: With dead ends: 166 [2023-02-15 21:59:19,995 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 21:59:19,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:19,999 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 128 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:20,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 106 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:20,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 21:59:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 119. [2023-02-15 21:59:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 2.0307692307692307) internal successors, (132), 118 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) [2023-02-15 21:59:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-02-15 21:59:20,033 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 3 [2023-02-15 21:59:20,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:20,033 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-02-15 21:59:20,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-02-15 21:59:20,034 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-02-15 21:59:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 21:59:20,034 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:20,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 21:59:20,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 21:59:20,035 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:20,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:20,035 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 21:59:20,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:20,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741613047] [2023-02-15 21:59:20,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:20,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:20,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741613047] [2023-02-15 21:59:20,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741613047] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:20,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:20,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:59:20,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458626096] [2023-02-15 21:59:20,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:20,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:59:20,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:20,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:59:20,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:20,102 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-02-15 21:59:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:20,229 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2023-02-15 21:59:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:59:20,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2023-02-15 21:59:20,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:20,231 INFO L225 Difference]: With dead ends: 160 [2023-02-15 21:59:20,233 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 21:59:20,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:20,235 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 125 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:20,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 110 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 21:59:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2023-02-15 21:59:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 65 states have (on average 2.0) internal successors, (130), 116 states have internal predecessors, (130), 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) [2023-02-15 21:59:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2023-02-15 21:59:20,255 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 3 [2023-02-15 21:59:20,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:20,256 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2023-02-15 21:59:20,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-02-15 21:59:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2023-02-15 21:59:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 21:59:20,259 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:20,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:20,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 21:59:20,260 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:20,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031021, now seen corresponding path program 1 times [2023-02-15 21:59:20,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:20,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316852789] [2023-02-15 21:59:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:20,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316852789] [2023-02-15 21:59:20,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316852789] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:20,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:20,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:59:20,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752660281] [2023-02-15 21:59:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:20,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:59:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:20,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:59:20,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:59:20,358 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-02-15 21:59:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:20,552 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2023-02-15 21:59:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:59:20,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2023-02-15 21:59:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:20,556 INFO L225 Difference]: With dead ends: 146 [2023-02-15 21:59:20,556 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 21:59:20,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:20,558 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 233 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:20,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 75 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:59:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 21:59:20,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2023-02-15 21:59:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 103 states have internal predecessors, (120), 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) [2023-02-15 21:59:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2023-02-15 21:59:20,566 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 7 [2023-02-15 21:59:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:20,567 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2023-02-15 21:59:20,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-02-15 21:59:20,567 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2023-02-15 21:59:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 21:59:20,568 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:20,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:20,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 21:59:20,569 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:20,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:20,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031022, now seen corresponding path program 1 times [2023-02-15 21:59:20,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:20,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002898356] [2023-02-15 21:59:20,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:20,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:20,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002898356] [2023-02-15 21:59:20,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002898356] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:20,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:20,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:59:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750703858] [2023-02-15 21:59:20,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:20,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:59:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:20,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:59:20,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:59:20,737 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-02-15 21:59:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:20,956 INFO L93 Difference]: Finished difference Result 227 states and 259 transitions. [2023-02-15 21:59:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:59:20,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2023-02-15 21:59:20,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:20,958 INFO L225 Difference]: With dead ends: 227 [2023-02-15 21:59:20,958 INFO L226 Difference]: Without dead ends: 227 [2023-02-15 21:59:20,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:20,959 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 267 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:20,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 124 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:59:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-15 21:59:20,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 172. [2023-02-15 21:59:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6985294117647058) internal successors, (231), 171 states have internal predecessors, (231), 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) [2023-02-15 21:59:20,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2023-02-15 21:59:20,979 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 7 [2023-02-15 21:59:20,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:20,979 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2023-02-15 21:59:20,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-02-15 21:59:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2023-02-15 21:59:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 21:59:20,980 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:20,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:20,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 21:59:20,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:20,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1237592114, now seen corresponding path program 1 times [2023-02-15 21:59:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:20,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758774243] [2023-02-15 21:59:20,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:20,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:21,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:21,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758774243] [2023-02-15 21:59:21,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758774243] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:21,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:21,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:59:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308784345] [2023-02-15 21:59:21,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:21,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:59:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:21,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:59:21,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:21,015 INFO L87 Difference]: Start difference. First operand 172 states and 231 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2023-02-15 21:59:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:21,032 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2023-02-15 21:59:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:59:21,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 [2023-02-15 21:59:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:21,033 INFO L225 Difference]: With dead ends: 186 [2023-02-15 21:59:21,034 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 21:59:21,034 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 [2023-02-15 21:59:21,035 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 103 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:21,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 156 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:59:21,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 21:59:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2023-02-15 21:59:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6838235294117647) internal successors, (229), 171 states have internal predecessors, (229), 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) [2023-02-15 21:59:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 229 transitions. [2023-02-15 21:59:21,042 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 229 transitions. Word has length 10 [2023-02-15 21:59:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:21,043 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 229 transitions. [2023-02-15 21:59:21,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-02-15 21:59:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2023-02-15 21:59:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 21:59:21,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:21,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:21,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 21:59:21,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:21,045 INFO L85 PathProgramCache]: Analyzing trace with hash -288934911, now seen corresponding path program 1 times [2023-02-15 21:59:21,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:21,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967191618] [2023-02-15 21:59:21,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:21,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:21,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967191618] [2023-02-15 21:59:21,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967191618] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:21,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:21,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:59:21,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660851366] [2023-02-15 21:59:21,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:21,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:59:21,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:21,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:59:21,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:21,076 INFO L87 Difference]: Start difference. First operand 172 states and 229 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-02-15 21:59:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:21,084 INFO L93 Difference]: Finished difference Result 175 states and 232 transitions. [2023-02-15 21:59:21,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:59:21,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 [2023-02-15 21:59:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:21,085 INFO L225 Difference]: With dead ends: 175 [2023-02-15 21:59:21,085 INFO L226 Difference]: Without dead ends: 175 [2023-02-15 21:59:21,086 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 [2023-02-15 21:59:21,086 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:21,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:59:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-15 21:59:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-02-15 21:59:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 139 states have (on average 1.669064748201439) internal successors, (232), 174 states have internal predecessors, (232), 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) [2023-02-15 21:59:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 232 transitions. [2023-02-15 21:59:21,099 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 232 transitions. Word has length 14 [2023-02-15 21:59:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:21,100 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 232 transitions. [2023-02-15 21:59:21,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-02-15 21:59:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 232 transitions. [2023-02-15 21:59:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 21:59:21,101 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:21,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:21,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 21:59:21,102 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:21,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1836248265, now seen corresponding path program 1 times [2023-02-15 21:59:21,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:21,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29502374] [2023-02-15 21:59:21,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:21,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:21,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29502374] [2023-02-15 21:59:21,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29502374] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:21,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:21,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:59:21,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588435793] [2023-02-15 21:59:21,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:21,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:59:21,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:21,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:59:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:21,167 INFO L87 Difference]: Start difference. First operand 175 states and 232 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-02-15 21:59:21,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:21,176 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2023-02-15 21:59:21,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:59:21,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 [2023-02-15 21:59:21,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:21,178 INFO L225 Difference]: With dead ends: 177 [2023-02-15 21:59:21,178 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 21:59:21,178 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 [2023-02-15 21:59:21,181 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:21,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:59:21,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 21:59:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-02-15 21:59:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.6595744680851063) internal successors, (234), 176 states have internal predecessors, (234), 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) [2023-02-15 21:59:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2023-02-15 21:59:21,194 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 14 [2023-02-15 21:59:21,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:21,195 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2023-02-15 21:59:21,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-02-15 21:59:21,195 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2023-02-15 21:59:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 21:59:21,197 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:21,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:21,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 21:59:21,198 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:21,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:21,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1556334460, now seen corresponding path program 1 times [2023-02-15 21:59:21,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:21,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233889891] [2023-02-15 21:59:21,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:21,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233889891] [2023-02-15 21:59:21,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233889891] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:21,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:21,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:59:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319795212] [2023-02-15 21:59:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:21,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:59:21,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:21,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:59:21,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:21,277 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2023-02-15 21:59:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:21,293 INFO L93 Difference]: Finished difference Result 192 states and 243 transitions. [2023-02-15 21:59:21,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:59:21,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2023-02-15 21:59:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:21,295 INFO L225 Difference]: With dead ends: 192 [2023-02-15 21:59:21,295 INFO L226 Difference]: Without dead ends: 192 [2023-02-15 21:59:21,295 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 [2023-02-15 21:59:21,298 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:21,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 216 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:59:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-15 21:59:21,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2023-02-15 21:59:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 143 states have (on average 1.6293706293706294) internal successors, (233), 178 states have internal predecessors, (233), 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) [2023-02-15 21:59:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 233 transitions. [2023-02-15 21:59:21,305 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 233 transitions. Word has length 16 [2023-02-15 21:59:21,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:21,305 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 233 transitions. [2023-02-15 21:59:21,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2023-02-15 21:59:21,306 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 233 transitions. [2023-02-15 21:59:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 21:59:21,311 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:21,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:21,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 21:59:21,312 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:21,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:21,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1356387674, now seen corresponding path program 1 times [2023-02-15 21:59:21,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:21,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208644229] [2023-02-15 21:59:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:21,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:21,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:21,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208644229] [2023-02-15 21:59:21,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208644229] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:21,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:21,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:59:21,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118261557] [2023-02-15 21:59:21,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:21,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:59:21,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:21,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:59:21,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:59:21,556 INFO L87 Difference]: Start difference. First operand 179 states and 233 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-02-15 21:59:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:21,762 INFO L93 Difference]: Finished difference Result 274 states and 343 transitions. [2023-02-15 21:59:21,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:59:21,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2023-02-15 21:59:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:21,764 INFO L225 Difference]: With dead ends: 274 [2023-02-15 21:59:21,764 INFO L226 Difference]: Without dead ends: 274 [2023-02-15 21:59:21,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:59:21,764 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 125 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:21,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 413 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:59:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-02-15 21:59:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 193. [2023-02-15 21:59:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 157 states have (on average 1.605095541401274) internal successors, (252), 192 states have internal predecessors, (252), 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) [2023-02-15 21:59:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 252 transitions. [2023-02-15 21:59:21,772 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 252 transitions. Word has length 16 [2023-02-15 21:59:21,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:21,772 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 252 transitions. [2023-02-15 21:59:21,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-02-15 21:59:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 252 transitions. [2023-02-15 21:59:21,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 21:59:21,776 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:21,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:21,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 21:59:21,777 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:21,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:21,780 INFO L85 PathProgramCache]: Analyzing trace with hash -508929720, now seen corresponding path program 1 times [2023-02-15 21:59:21,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:21,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361668245] [2023-02-15 21:59:21,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:21,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:21,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:21,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361668245] [2023-02-15 21:59:21,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361668245] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:21,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:21,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:59:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463024867] [2023-02-15 21:59:21,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:21,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:59:21,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:21,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:59:21,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:59:21,944 INFO L87 Difference]: Start difference. First operand 193 states and 252 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2023-02-15 21:59:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:22,138 INFO L93 Difference]: Finished difference Result 273 states and 341 transitions. [2023-02-15 21:59:22,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:59:22,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2023-02-15 21:59:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:22,140 INFO L225 Difference]: With dead ends: 273 [2023-02-15 21:59:22,140 INFO L226 Difference]: Without dead ends: 273 [2023-02-15 21:59:22,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-15 21:59:22,141 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 128 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:22,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 417 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-15 21:59:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 228. [2023-02-15 21:59:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 192 states have (on average 1.609375) internal successors, (309), 227 states have internal predecessors, (309), 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) [2023-02-15 21:59:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 309 transitions. [2023-02-15 21:59:22,147 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 309 transitions. Word has length 17 [2023-02-15 21:59:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:22,148 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 309 transitions. [2023-02-15 21:59:22,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2023-02-15 21:59:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 309 transitions. [2023-02-15 21:59:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 21:59:22,148 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:22,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:22,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 21:59:22,149 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:22,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:22,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1001745105, now seen corresponding path program 1 times [2023-02-15 21:59:22,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:22,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607067741] [2023-02-15 21:59:22,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:22,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:22,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:22,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607067741] [2023-02-15 21:59:22,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607067741] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:22,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:22,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:59:22,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125300124] [2023-02-15 21:59:22,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:22,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:59:22,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:22,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:59:22,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:59:22,189 INFO L87 Difference]: Start difference. First operand 228 states and 309 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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) [2023-02-15 21:59:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:22,288 INFO L93 Difference]: Finished difference Result 266 states and 328 transitions. [2023-02-15 21:59:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:59:22,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-02-15 21:59:22,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:22,290 INFO L225 Difference]: With dead ends: 266 [2023-02-15 21:59:22,290 INFO L226 Difference]: Without dead ends: 266 [2023-02-15 21:59:22,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:22,291 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 230 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:22,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 190 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-15 21:59:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 229. [2023-02-15 21:59:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 228 states have internal predecessors, (310), 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) [2023-02-15 21:59:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 310 transitions. [2023-02-15 21:59:22,301 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 310 transitions. Word has length 17 [2023-02-15 21:59:22,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:22,301 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 310 transitions. [2023-02-15 21:59:22,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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) [2023-02-15 21:59:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 310 transitions. [2023-02-15 21:59:22,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 21:59:22,302 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:22,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:22,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 21:59:22,303 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:22,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793954, now seen corresponding path program 1 times [2023-02-15 21:59:22,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:22,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457005852] [2023-02-15 21:59:22,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:22,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:22,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:22,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457005852] [2023-02-15 21:59:22,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457005852] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:22,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:22,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:59:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597956530] [2023-02-15 21:59:22,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:22,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:59:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:22,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:59:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:22,381 INFO L87 Difference]: Start difference. First operand 229 states and 310 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-02-15 21:59:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:22,498 INFO L93 Difference]: Finished difference Result 228 states and 308 transitions. [2023-02-15 21:59:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:59:22,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-02-15 21:59:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:22,500 INFO L225 Difference]: With dead ends: 228 [2023-02-15 21:59:22,500 INFO L226 Difference]: Without dead ends: 228 [2023-02-15 21:59:22,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:59:22,501 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 7 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:22,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 287 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:22,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-02-15 21:59:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2023-02-15 21:59:22,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 193 states have (on average 1.5958549222797926) internal successors, (308), 227 states have internal predecessors, (308), 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) [2023-02-15 21:59:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 308 transitions. [2023-02-15 21:59:22,505 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 308 transitions. Word has length 18 [2023-02-15 21:59:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:22,506 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 308 transitions. [2023-02-15 21:59:22,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-02-15 21:59:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2023-02-15 21:59:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 21:59:22,506 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:22,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:22,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 21:59:22,507 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:22,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:22,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793955, now seen corresponding path program 1 times [2023-02-15 21:59:22,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:22,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167956116] [2023-02-15 21:59:22,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:22,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:22,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:22,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167956116] [2023-02-15 21:59:22,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167956116] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:22,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:22,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:59:22,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940136159] [2023-02-15 21:59:22,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:22,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:59:22,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:22,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:59:22,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:22,635 INFO L87 Difference]: Start difference. First operand 228 states and 308 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-02-15 21:59:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:22,768 INFO L93 Difference]: Finished difference Result 227 states and 306 transitions. [2023-02-15 21:59:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:59:22,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-02-15 21:59:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:22,770 INFO L225 Difference]: With dead ends: 227 [2023-02-15 21:59:22,770 INFO L226 Difference]: Without dead ends: 227 [2023-02-15 21:59:22,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:59:22,770 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 5 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:22,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 264 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-15 21:59:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2023-02-15 21:59:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 193 states have (on average 1.5854922279792747) internal successors, (306), 226 states have internal predecessors, (306), 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) [2023-02-15 21:59:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2023-02-15 21:59:22,784 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 18 [2023-02-15 21:59:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:22,784 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2023-02-15 21:59:22,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-02-15 21:59:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2023-02-15 21:59:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 21:59:22,785 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:22,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:22,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 21:59:22,787 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:22,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash 624480237, now seen corresponding path program 1 times [2023-02-15 21:59:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:22,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26058215] [2023-02-15 21:59:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:22,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:22,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26058215] [2023-02-15 21:59:22,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26058215] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:22,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:22,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:59:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326861444] [2023-02-15 21:59:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:22,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:59:22,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:22,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:59:22,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:59:22,882 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2023-02-15 21:59:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:23,036 INFO L93 Difference]: Finished difference Result 243 states and 325 transitions. [2023-02-15 21:59:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:59:23,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2023-02-15 21:59:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:23,038 INFO L225 Difference]: With dead ends: 243 [2023-02-15 21:59:23,038 INFO L226 Difference]: Without dead ends: 243 [2023-02-15 21:59:23,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:59:23,039 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 33 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:23,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 301 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-15 21:59:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 234. [2023-02-15 21:59:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 200 states have (on average 1.575) internal successors, (315), 233 states have internal predecessors, (315), 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) [2023-02-15 21:59:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 315 transitions. [2023-02-15 21:59:23,044 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 315 transitions. Word has length 19 [2023-02-15 21:59:23,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:23,044 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 315 transitions. [2023-02-15 21:59:23,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2023-02-15 21:59:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 315 transitions. [2023-02-15 21:59:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 21:59:23,045 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:23,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:23,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 21:59:23,045 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:23,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash 624664935, now seen corresponding path program 1 times [2023-02-15 21:59:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:23,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165206756] [2023-02-15 21:59:23,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:23,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:23,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165206756] [2023-02-15 21:59:23,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165206756] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:23,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:23,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:59:23,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451139553] [2023-02-15 21:59:23,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:23,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 21:59:23,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:23,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 21:59:23,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:59:23,211 INFO L87 Difference]: Start difference. First operand 234 states and 315 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2023-02-15 21:59:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:23,517 INFO L93 Difference]: Finished difference Result 339 states and 423 transitions. [2023-02-15 21:59:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:59:23,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 19 [2023-02-15 21:59:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:23,519 INFO L225 Difference]: With dead ends: 339 [2023-02-15 21:59:23,519 INFO L226 Difference]: Without dead ends: 339 [2023-02-15 21:59:23,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 21:59:23,520 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 289 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:23,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 418 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:59:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-02-15 21:59:23,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 289. [2023-02-15 21:59:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 255 states have (on average 1.5490196078431373) internal successors, (395), 288 states have internal predecessors, (395), 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) [2023-02-15 21:59:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 395 transitions. [2023-02-15 21:59:23,525 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 395 transitions. Word has length 19 [2023-02-15 21:59:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:23,525 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 395 transitions. [2023-02-15 21:59:23,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2023-02-15 21:59:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 395 transitions. [2023-02-15 21:59:23,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 21:59:23,526 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:23,526 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:23,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 21:59:23,526 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:23,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:23,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1555885541, now seen corresponding path program 1 times [2023-02-15 21:59:23,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:23,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279261169] [2023-02-15 21:59:23,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:23,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:23,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:23,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279261169] [2023-02-15 21:59:23,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279261169] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:23,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:23,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:59:23,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276338097] [2023-02-15 21:59:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:23,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:59:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:23,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:59:23,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:23,562 INFO L87 Difference]: Start difference. First operand 289 states and 395 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) [2023-02-15 21:59:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:23,570 INFO L93 Difference]: Finished difference Result 264 states and 344 transitions. [2023-02-15 21:59:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:59:23,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 20 [2023-02-15 21:59:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:23,572 INFO L225 Difference]: With dead ends: 264 [2023-02-15 21:59:23,572 INFO L226 Difference]: Without dead ends: 264 [2023-02-15 21:59:23,572 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 [2023-02-15 21:59:23,573 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:23,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 214 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:59:23,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-02-15 21:59:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2023-02-15 21:59:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 228 states have (on average 1.5087719298245614) internal successors, (344), 261 states have internal predecessors, (344), 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) [2023-02-15 21:59:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 344 transitions. [2023-02-15 21:59:23,577 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 344 transitions. Word has length 20 [2023-02-15 21:59:23,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:23,578 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 344 transitions. [2023-02-15 21:59:23,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) [2023-02-15 21:59:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 344 transitions. [2023-02-15 21:59:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 21:59:23,578 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:23,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:23,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 21:59:23,579 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:23,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:23,579 INFO L85 PathProgramCache]: Analyzing trace with hash 987811916, now seen corresponding path program 1 times [2023-02-15 21:59:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:23,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368669592] [2023-02-15 21:59:23,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:23,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:23,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:23,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368669592] [2023-02-15 21:59:23,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368669592] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:59:23,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049484188] [2023-02-15 21:59:23,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:23,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:59:23,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:59:23,709 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) [2023-02-15 21:59:23,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 21:59:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:23,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 21:59:23,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:59:23,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 15 treesize of output 14 [2023-02-15 21:59:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:24,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:59:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:24,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049484188] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:59:24,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:59:24,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-15 21:59:24,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893671072] [2023-02-15 21:59:24,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:59:24,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:59:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:24,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:59:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:59:24,065 INFO L87 Difference]: Start difference. First operand 262 states and 344 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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) [2023-02-15 21:59:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:24,220 INFO L93 Difference]: Finished difference Result 275 states and 357 transitions. [2023-02-15 21:59:24,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:59:24,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 21 [2023-02-15 21:59:24,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:24,221 INFO L225 Difference]: With dead ends: 275 [2023-02-15 21:59:24,221 INFO L226 Difference]: Without dead ends: 259 [2023-02-15 21:59:24,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:59:24,222 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:24,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 284 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-02-15 21:59:24,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2023-02-15 21:59:24,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 223 states have (on average 1.515695067264574) internal successors, (338), 256 states have internal predecessors, (338), 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) [2023-02-15 21:59:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 338 transitions. [2023-02-15 21:59:24,227 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 338 transitions. Word has length 21 [2023-02-15 21:59:24,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:24,227 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 338 transitions. [2023-02-15 21:59:24,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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) [2023-02-15 21:59:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 338 transitions. [2023-02-15 21:59:24,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 21:59:24,239 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:24,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:24,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 21:59:24,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 21:59:24,445 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:24,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983029, now seen corresponding path program 1 times [2023-02-15 21:59:24,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:24,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042109649] [2023-02-15 21:59:24,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:24,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:24,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:24,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042109649] [2023-02-15 21:59:24,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042109649] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:24,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:24,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:59:24,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490350029] [2023-02-15 21:59:24,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:24,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:59:24,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:24,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:59:24,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:59:24,599 INFO L87 Difference]: Start difference. First operand 257 states and 338 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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) [2023-02-15 21:59:24,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:24,836 INFO L93 Difference]: Finished difference Result 258 states and 337 transitions. [2023-02-15 21:59:24,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:59:24,836 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 21 [2023-02-15 21:59:24,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:24,837 INFO L225 Difference]: With dead ends: 258 [2023-02-15 21:59:24,837 INFO L226 Difference]: Without dead ends: 258 [2023-02-15 21:59:24,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:59:24,838 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 92 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:24,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 277 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:59:24,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-02-15 21:59:24,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2023-02-15 21:59:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 223 states have (on average 1.5022421524663676) internal successors, (335), 255 states have internal predecessors, (335), 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) [2023-02-15 21:59:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 335 transitions. [2023-02-15 21:59:24,843 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 335 transitions. Word has length 21 [2023-02-15 21:59:24,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:24,844 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 335 transitions. [2023-02-15 21:59:24,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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) [2023-02-15 21:59:24,844 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 335 transitions. [2023-02-15 21:59:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 21:59:24,844 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:24,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:24,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 21:59:24,845 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:24,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:24,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983030, now seen corresponding path program 1 times [2023-02-15 21:59:24,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:24,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3796089] [2023-02-15 21:59:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:24,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:25,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:25,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3796089] [2023-02-15 21:59:25,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3796089] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:25,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:25,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:59:25,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002264532] [2023-02-15 21:59:25,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:25,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:59:25,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:25,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:59:25,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:59:25,055 INFO L87 Difference]: Start difference. First operand 256 states and 335 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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) [2023-02-15 21:59:25,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:25,311 INFO L93 Difference]: Finished difference Result 257 states and 334 transitions. [2023-02-15 21:59:25,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:59:25,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 21 [2023-02-15 21:59:25,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:25,312 INFO L225 Difference]: With dead ends: 257 [2023-02-15 21:59:25,312 INFO L226 Difference]: Without dead ends: 257 [2023-02-15 21:59:25,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:59:25,313 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 92 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:25,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 222 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:59:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-02-15 21:59:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2023-02-15 21:59:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 223 states have (on average 1.4887892376681615) internal successors, (332), 254 states have internal predecessors, (332), 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) [2023-02-15 21:59:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 332 transitions. [2023-02-15 21:59:25,317 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 332 transitions. Word has length 21 [2023-02-15 21:59:25,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:25,318 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 332 transitions. [2023-02-15 21:59:25,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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) [2023-02-15 21:59:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 332 transitions. [2023-02-15 21:59:25,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 21:59:25,318 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:25,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:25,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 21:59:25,318 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:25,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash 27790463, now seen corresponding path program 1 times [2023-02-15 21:59:25,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:25,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607636592] [2023-02-15 21:59:25,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:25,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:25,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:25,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607636592] [2023-02-15 21:59:25,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607636592] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:25,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:25,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:59:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395764583] [2023-02-15 21:59:25,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:25,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:59:25,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:25,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:59:25,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:25,390 INFO L87 Difference]: Start difference. First operand 255 states and 332 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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) [2023-02-15 21:59:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:25,504 INFO L93 Difference]: Finished difference Result 254 states and 330 transitions. [2023-02-15 21:59:25,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:59:25,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 [2023-02-15 21:59:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:25,506 INFO L225 Difference]: With dead ends: 254 [2023-02-15 21:59:25,506 INFO L226 Difference]: Without dead ends: 254 [2023-02-15 21:59:25,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:59:25,506 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:25,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 277 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:25,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-02-15 21:59:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2023-02-15 21:59:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 223 states have (on average 1.4798206278026906) internal successors, (330), 253 states have internal predecessors, (330), 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) [2023-02-15 21:59:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 330 transitions. [2023-02-15 21:59:25,511 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 330 transitions. Word has length 22 [2023-02-15 21:59:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:25,511 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 330 transitions. [2023-02-15 21:59:25,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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) [2023-02-15 21:59:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 330 transitions. [2023-02-15 21:59:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 21:59:25,512 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:25,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:25,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 21:59:25,512 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:25,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:25,513 INFO L85 PathProgramCache]: Analyzing trace with hash 27790464, now seen corresponding path program 1 times [2023-02-15 21:59:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:25,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612491973] [2023-02-15 21:59:25,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:25,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:25,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:25,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612491973] [2023-02-15 21:59:25,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612491973] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:25,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:25,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:59:25,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79609452] [2023-02-15 21:59:25,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:25,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:59:25,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:25,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:59:25,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:25,640 INFO L87 Difference]: Start difference. First operand 254 states and 330 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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) [2023-02-15 21:59:25,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:25,768 INFO L93 Difference]: Finished difference Result 253 states and 328 transitions. [2023-02-15 21:59:25,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:59:25,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 [2023-02-15 21:59:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:25,770 INFO L225 Difference]: With dead ends: 253 [2023-02-15 21:59:25,770 INFO L226 Difference]: Without dead ends: 253 [2023-02-15 21:59:25,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:59:25,770 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:25,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 254 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-15 21:59:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2023-02-15 21:59:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 223 states have (on average 1.4708520179372198) internal successors, (328), 252 states have internal predecessors, (328), 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) [2023-02-15 21:59:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 328 transitions. [2023-02-15 21:59:25,775 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 328 transitions. Word has length 22 [2023-02-15 21:59:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:25,775 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 328 transitions. [2023-02-15 21:59:25,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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) [2023-02-15 21:59:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 328 transitions. [2023-02-15 21:59:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 21:59:25,776 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:25,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:25,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 21:59:25,776 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:25,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919462, now seen corresponding path program 1 times [2023-02-15 21:59:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:25,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794631575] [2023-02-15 21:59:25,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:25,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:25,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794631575] [2023-02-15 21:59:25,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794631575] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:25,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:25,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:59:25,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054367515] [2023-02-15 21:59:25,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:25,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:59:25,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:59:25,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:59:25,928 INFO L87 Difference]: Start difference. First operand 253 states and 328 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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) [2023-02-15 21:59:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:26,151 INFO L93 Difference]: Finished difference Result 254 states and 329 transitions. [2023-02-15 21:59:26,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:59:26,151 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 25 [2023-02-15 21:59:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:26,152 INFO L225 Difference]: With dead ends: 254 [2023-02-15 21:59:26,153 INFO L226 Difference]: Without dead ends: 254 [2023-02-15 21:59:26,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:59:26,153 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 84 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:26,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 228 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:59:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-02-15 21:59:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2023-02-15 21:59:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 223 states have (on average 1.4663677130044843) internal successors, (327), 251 states have internal predecessors, (327), 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) [2023-02-15 21:59:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 327 transitions. [2023-02-15 21:59:26,158 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 327 transitions. Word has length 25 [2023-02-15 21:59:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:26,158 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 327 transitions. [2023-02-15 21:59:26,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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) [2023-02-15 21:59:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 327 transitions. [2023-02-15 21:59:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 21:59:26,158 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:26,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:26,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 21:59:26,159 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:26,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:26,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919461, now seen corresponding path program 1 times [2023-02-15 21:59:26,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:26,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374667860] [2023-02-15 21:59:26,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:26,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:26,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:26,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374667860] [2023-02-15 21:59:26,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374667860] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:26,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:26,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:59:26,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855936516] [2023-02-15 21:59:26,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:26,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:59:26,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:26,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:59:26,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:59:26,380 INFO L87 Difference]: Start difference. First operand 252 states and 327 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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) [2023-02-15 21:59:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:26,699 INFO L93 Difference]: Finished difference Result 253 states and 328 transitions. [2023-02-15 21:59:26,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:59:26,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 25 [2023-02-15 21:59:26,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:26,700 INFO L225 Difference]: With dead ends: 253 [2023-02-15 21:59:26,700 INFO L226 Difference]: Without dead ends: 253 [2023-02-15 21:59:26,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:59:26,701 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 81 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:26,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 255 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:59:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-15 21:59:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2023-02-15 21:59:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 223 states have (on average 1.4618834080717489) internal successors, (326), 250 states have internal predecessors, (326), 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) [2023-02-15 21:59:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 326 transitions. [2023-02-15 21:59:26,705 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 326 transitions. Word has length 25 [2023-02-15 21:59:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:26,705 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 326 transitions. [2023-02-15 21:59:26,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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) [2023-02-15 21:59:26,705 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 326 transitions. [2023-02-15 21:59:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 21:59:26,705 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:26,705 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:26,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 21:59:26,706 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash -756843594, now seen corresponding path program 1 times [2023-02-15 21:59:26,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:26,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506268930] [2023-02-15 21:59:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:26,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:27,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506268930] [2023-02-15 21:59:27,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506268930] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:59:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435365774] [2023-02-15 21:59:27,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:27,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:59:27,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:59:27,562 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) [2023-02-15 21:59:27,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 21:59:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:27,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 21:59:27,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:59:28,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 21:59:28,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 21:59:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:28,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:59:28,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:28,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2023-02-15 21:59:28,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:28,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2023-02-15 21:59:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:28,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435365774] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:59:28,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:59:28,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 33 [2023-02-15 21:59:28,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764974955] [2023-02-15 21:59:28,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:59:28,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 21:59:28,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:28,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 21:59:28,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2023-02-15 21:59:28,722 INFO L87 Difference]: Start difference. First operand 251 states and 326 transitions. Second operand has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 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) [2023-02-15 21:59:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:30,986 INFO L93 Difference]: Finished difference Result 385 states and 466 transitions. [2023-02-15 21:59:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 21:59:30,987 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 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 38 [2023-02-15 21:59:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:30,988 INFO L225 Difference]: With dead ends: 385 [2023-02-15 21:59:30,988 INFO L226 Difference]: Without dead ends: 385 [2023-02-15 21:59:30,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=977, Invalid=3055, Unknown=0, NotChecked=0, Total=4032 [2023-02-15 21:59:30,990 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 644 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:30,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1234 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 21:59:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-02-15 21:59:30,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 251. [2023-02-15 21:59:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 223 states have (on average 1.4035874439461884) internal successors, (313), 250 states have internal predecessors, (313), 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) [2023-02-15 21:59:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 313 transitions. [2023-02-15 21:59:30,997 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 313 transitions. Word has length 38 [2023-02-15 21:59:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:30,997 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 313 transitions. [2023-02-15 21:59:30,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 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) [2023-02-15 21:59:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 313 transitions. [2023-02-15 21:59:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 21:59:30,998 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:30,998 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:31,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 21:59:31,203 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,SelfDestructingSolverStorable23 [2023-02-15 21:59:31,204 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:31,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash 734177974, now seen corresponding path program 1 times [2023-02-15 21:59:31,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:31,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523824118] [2023-02-15 21:59:31,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:31,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:31,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:31,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523824118] [2023-02-15 21:59:31,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523824118] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:59:31,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537036122] [2023-02-15 21:59:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:31,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:59:31,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:59:31,633 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) [2023-02-15 21:59:31,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 21:59:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:31,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 21:59:31,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:59:31,998 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 21:59:31,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 21:59:32,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:59:32,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 21:59:32,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:59:32,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 21:59:32,165 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:59:32,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2023-02-15 21:59:32,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-02-15 21:59:32,252 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:59:32,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2023-02-15 21:59:32,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-02-15 21:59:32,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 21:59:32,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:32,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 21:59:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:32,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:59:32,381 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_549 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_549) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2023-02-15 21:59:32,397 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)))) (and (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_549 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_549) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2023-02-15 21:59:32,415 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_546) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_549) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_547))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_548)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2023-02-15 21:59:32,426 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_548)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_546) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_547) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_549) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2023-02-15 21:59:32,448 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base|)))) (and (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_548)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.offset|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_546) (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_549) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2023-02-15 21:59:32,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:32,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 112 [2023-02-15 21:59:32,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:32,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 109 [2023-02-15 21:59:32,989 INFO L321 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2023-02-15 21:59:32,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 291 treesize of output 213 [2023-02-15 21:59:33,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 171 [2023-02-15 21:59:33,024 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-15 21:59:33,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 318 treesize of output 309 [2023-02-15 21:59:33,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 277 [2023-02-15 21:59:33,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 273 [2023-02-15 21:59:33,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 249 [2023-02-15 21:59:33,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:33,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 242 [2023-02-15 21:59:33,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 227 [2023-02-15 21:59:33,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:33,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 234 treesize of output 252 [2023-02-15 21:59:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:33,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537036122] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:59:33,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:59:33,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2023-02-15 21:59:33,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237325703] [2023-02-15 21:59:33,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:59:33,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 21:59:33,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:33,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 21:59:33,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=672, Unknown=6, NotChecked=290, Total=1122 [2023-02-15 21:59:33,247 INFO L87 Difference]: Start difference. First operand 251 states and 313 transitions. Second operand has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 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) [2023-02-15 21:59:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:35,181 INFO L93 Difference]: Finished difference Result 511 states and 634 transitions. [2023-02-15 21:59:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 21:59:35,182 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 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) Word has length 38 [2023-02-15 21:59:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:35,184 INFO L225 Difference]: With dead ends: 511 [2023-02-15 21:59:35,184 INFO L226 Difference]: Without dead ends: 511 [2023-02-15 21:59:35,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=448, Invalid=1546, Unknown=6, NotChecked=450, Total=2450 [2023-02-15 21:59:35,185 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 467 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 38 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 1119 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:35,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1350 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1475 Invalid, 11 Unknown, 1119 Unchecked, 1.1s Time] [2023-02-15 21:59:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-02-15 21:59:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 300. [2023-02-15 21:59:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 272 states have (on average 1.3786764705882353) internal successors, (375), 299 states have internal predecessors, (375), 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) [2023-02-15 21:59:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 375 transitions. [2023-02-15 21:59:35,192 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 375 transitions. Word has length 38 [2023-02-15 21:59:35,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:35,192 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 375 transitions. [2023-02-15 21:59:35,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 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) [2023-02-15 21:59:35,192 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 375 transitions. [2023-02-15 21:59:35,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 21:59:35,193 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:35,193 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:35,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 21:59:35,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:59:35,394 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589588, now seen corresponding path program 1 times [2023-02-15 21:59:35,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:35,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424555121] [2023-02-15 21:59:35,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:35,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:35,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:35,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424555121] [2023-02-15 21:59:35,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424555121] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:59:35,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140015492] [2023-02-15 21:59:35,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:35,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:59:35,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:59:35,725 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) [2023-02-15 21:59:35,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 21:59:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:35,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 21:59:35,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:59:35,941 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 21:59:35,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 21:59:35,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 21:59:36,062 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:59:36,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 21:59:36,116 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:59:36,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 21:59:36,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 21:59:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:36,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:59:36,355 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_622) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2023-02-15 21:59:36,364 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_622)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2023-02-15 21:59:36,369 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_622)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2023-02-15 21:59:36,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:36,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2023-02-15 21:59:36,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:36,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 131 [2023-02-15 21:59:36,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:36,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 114 [2023-02-15 21:59:36,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2023-02-15 21:59:39,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:39,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 80 treesize of output 234 [2023-02-15 21:59:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:41,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140015492] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:59:41,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:59:41,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2023-02-15 21:59:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734244731] [2023-02-15 21:59:41,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:59:41,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 21:59:41,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:41,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 21:59:41,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=567, Unknown=9, NotChecked=156, Total=870 [2023-02-15 21:59:41,250 INFO L87 Difference]: Start difference. First operand 300 states and 375 transitions. Second operand has 30 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 30 states have internal predecessors, (94), 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) [2023-02-15 21:59:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:42,310 INFO L93 Difference]: Finished difference Result 603 states and 766 transitions. [2023-02-15 21:59:42,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 21:59:42,310 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 30 states have internal predecessors, (94), 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 39 [2023-02-15 21:59:42,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:42,312 INFO L225 Difference]: With dead ends: 603 [2023-02-15 21:59:42,312 INFO L226 Difference]: Without dead ends: 603 [2023-02-15 21:59:42,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=304, Invalid=1031, Unknown=9, NotChecked=216, Total=1560 [2023-02-15 21:59:42,313 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 640 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 771 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:42,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 969 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1470 Invalid, 0 Unknown, 771 Unchecked, 0.8s Time] [2023-02-15 21:59:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2023-02-15 21:59:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 402. [2023-02-15 21:59:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 374 states have (on average 1.3877005347593583) internal successors, (519), 401 states have internal predecessors, (519), 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) [2023-02-15 21:59:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 519 transitions. [2023-02-15 21:59:42,321 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 519 transitions. Word has length 39 [2023-02-15 21:59:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:42,321 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 519 transitions. [2023-02-15 21:59:42,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 30 states have internal predecessors, (94), 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) [2023-02-15 21:59:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 519 transitions. [2023-02-15 21:59:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 21:59:42,322 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:42,322 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:42,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 21:59:42,528 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,SelfDestructingSolverStorable25 [2023-02-15 21:59:42,528 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 21:59:42,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589587, now seen corresponding path program 1 times [2023-02-15 21:59:42,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:42,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304727646] [2023-02-15 21:59:42,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:42,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:42,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:42,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304727646] [2023-02-15 21:59:42,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304727646] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:59:42,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899904628] [2023-02-15 21:59:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:42,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:59:42,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:59:42,993 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) [2023-02-15 21:59:42,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 21:59:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:43,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-15 21:59:43,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:59:43,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:59:43,229 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 21:59:43,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 21:59:43,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 21:59:43,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 21:59:43,363 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:59:43,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 21:59:43,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 21:59:43,427 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:59:43,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 21:59:43,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 21:59:43,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 21:59:43,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 21:59:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:43,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:59:43,738 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_699) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (forall ((v_ArrVal_699 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_699) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2023-02-15 21:59:43,819 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_696))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_697) .cse0 v_ArrVal_699) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_697) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_696) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_699) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2023-02-15 21:59:43,829 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_696))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_697) .cse1 v_ArrVal_699) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_697) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_696) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_699) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2023-02-15 21:59:43,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:43,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2023-02-15 21:59:43,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:43,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2023-02-15 21:59:43,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:43,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 632 treesize of output 567 [2023-02-15 21:59:43,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:43,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1168 treesize of output 1111 [2023-02-15 21:59:43,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1096 treesize of output 1048 [2023-02-15 21:59:43,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1048 treesize of output 1000 [2023-02-15 21:59:43,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1000 treesize of output 984 [2023-02-15 21:59:43,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:59:43,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 984 treesize of output 892 [2023-02-15 22:00:06,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:06,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-15 22:00:06,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:06,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 22:00:06,106 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:06,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-02-15 22:00:06,110 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:06,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 22:00:06,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:06,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2023-02-15 22:00:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:06,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899904628] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:00:06,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:00:06,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2023-02-15 22:00:06,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178062950] [2023-02-15 22:00:06,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:00:06,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 22:00:06,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:06,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 22:00:06,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=789, Unknown=15, NotChecked=180, Total=1122 [2023-02-15 22:00:06,267 INFO L87 Difference]: Start difference. First operand 402 states and 519 transitions. Second operand has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 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) [2023-02-15 22:00:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:37,074 INFO L93 Difference]: Finished difference Result 623 states and 773 transitions. [2023-02-15 22:00:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 22:00:37,074 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 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 39 [2023-02-15 22:00:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:37,076 INFO L225 Difference]: With dead ends: 623 [2023-02-15 22:00:37,076 INFO L226 Difference]: Without dead ends: 623 [2023-02-15 22:00:37,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=627, Invalid=2327, Unknown=28, NotChecked=324, Total=3306 [2023-02-15 22:00:37,078 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 1116 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 661 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:37,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 1051 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1390 Invalid, 0 Unknown, 661 Unchecked, 4.2s Time] [2023-02-15 22:00:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-02-15 22:00:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 417. [2023-02-15 22:00:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 395 states have (on average 1.3822784810126583) internal successors, (546), 416 states have internal predecessors, (546), 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) [2023-02-15 22:00:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 546 transitions. [2023-02-15 22:00:37,086 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 546 transitions. Word has length 39 [2023-02-15 22:00:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:37,087 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 546 transitions. [2023-02-15 22:00:37,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 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) [2023-02-15 22:00:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 546 transitions. [2023-02-15 22:00:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:00:37,088 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:37,088 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:37,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:37,294 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,SelfDestructingSolverStorable26 [2023-02-15 22:00:37,295 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 22:00:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:37,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1594404890, now seen corresponding path program 1 times [2023-02-15 22:00:37,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:37,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637333459] [2023-02-15 22:00:37,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:37,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:00:37,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:37,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637333459] [2023-02-15 22:00:37,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637333459] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:37,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:37,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:00:37,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440388278] [2023-02-15 22:00:37,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:37,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:00:37,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:37,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:00:37,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:00:37,626 INFO L87 Difference]: Start difference. First operand 417 states and 546 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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) [2023-02-15 22:00:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:38,442 INFO L93 Difference]: Finished difference Result 417 states and 540 transitions. [2023-02-15 22:00:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:00:38,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 39 [2023-02-15 22:00:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:38,444 INFO L225 Difference]: With dead ends: 417 [2023-02-15 22:00:38,444 INFO L226 Difference]: Without dead ends: 417 [2023-02-15 22:00:38,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:00:38,444 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 12 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:38,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 299 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 22:00:38,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-02-15 22:00:38,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 411. [2023-02-15 22:00:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 389 states have (on average 1.3727506426735219) internal successors, (534), 410 states have internal predecessors, (534), 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) [2023-02-15 22:00:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 534 transitions. [2023-02-15 22:00:38,451 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 534 transitions. Word has length 39 [2023-02-15 22:00:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:38,452 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 534 transitions. [2023-02-15 22:00:38,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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) [2023-02-15 22:00:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 534 transitions. [2023-02-15 22:00:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:00:38,452 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:38,453 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:38,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-15 22:00:38,453 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 22:00:38,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:38,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1677406060, now seen corresponding path program 1 times [2023-02-15 22:00:38,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:38,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735956657] [2023-02-15 22:00:38,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:38,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:39,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:39,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735956657] [2023-02-15 22:00:39,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735956657] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:39,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:39,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-15 22:00:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724836228] [2023-02-15 22:00:39,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:39,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:00:39,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:39,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:00:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:00:39,790 INFO L87 Difference]: Start difference. First operand 411 states and 534 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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) [2023-02-15 22:00:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:43,585 INFO L93 Difference]: Finished difference Result 549 states and 686 transitions. [2023-02-15 22:00:43,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 22:00:43,585 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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 39 [2023-02-15 22:00:43,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:43,587 INFO L225 Difference]: With dead ends: 549 [2023-02-15 22:00:43,587 INFO L226 Difference]: Without dead ends: 549 [2023-02-15 22:00:43,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2023-02-15 22:00:43,588 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 173 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:43,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 845 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-02-15 22:00:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2023-02-15 22:00:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 424. [2023-02-15 22:00:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 402 states have (on average 1.3830845771144278) internal successors, (556), 423 states have internal predecessors, (556), 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) [2023-02-15 22:00:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 556 transitions. [2023-02-15 22:00:43,597 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 556 transitions. Word has length 39 [2023-02-15 22:00:43,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:43,597 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 556 transitions. [2023-02-15 22:00:43,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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) [2023-02-15 22:00:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 556 transitions. [2023-02-15 22:00:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:00:43,598 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:43,598 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:43,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-15 22:00:43,599 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-15 22:00:43,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:43,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1454341771, now seen corresponding path program 1 times [2023-02-15 22:00:43,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:43,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409067240] [2023-02-15 22:00:43,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:43,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:44,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:44,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409067240] [2023-02-15 22:00:44,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409067240] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:00:44,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831395269] [2023-02-15 22:00:44,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:44,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:00:44,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:00:44,774 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) [2023-02-15 22:00:44,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:00:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:44,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 22:00:44,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:44,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:00:44,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:00:45,763 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:00:45,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:00:46,004 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 22:00:46,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-02-15 22:00:46,083 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 22:00:46,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 22:00:46,580 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:46,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 56 [2023-02-15 22:00:46,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2023-02-15 22:00:47,070 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:47,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 78 [2023-02-15 22:00:47,115 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:47,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 97 [2023-02-15 22:00:48,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:48,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 72 [2023-02-15 22:00:48,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-02-15 22:00:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:49,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:50,818 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_845))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_847)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_845))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (or (forall ((v_ArrVal_848 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_846) .cse4 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_847 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse5 .cse4 v_ArrVal_847) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) 1)))))))) is different from false [2023-02-15 22:00:50,871 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (and (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_845))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_847)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_845))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (or (forall ((v_ArrVal_848 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_846) .cse5 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_847 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse6 .cse5 v_ArrVal_847) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) 1))))))))) is different from false [2023-02-15 22:00:50,972 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse0 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse4 .cse0 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_845))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0))) (or (forall ((v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc20#1.offset|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_846) .cse1 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_847 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse3 .cse1 v_ArrVal_847) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) 1))))))) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse5 (select (select (let ((.cse7 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse4 .cse7 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_845))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~n~0#1.base|) .cse7) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (or (= .cse5 0) (= (select |c_#valid| .cse5) 1)))))) is different from false [2023-02-15 22:00:52,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:52,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 382 treesize of output 698 [2023-02-15 22:01:13,788 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|))) (and (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (= |c_ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse1 (+ v_prenex_10 4))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse1 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse4 (select (select (let ((.cse6 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse6 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse6) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse4 v_prenex_8) (= .cse4 0) (= .cse4 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse4)))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse8 (+ v_prenex_10 4))) (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse8 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~n~0#1.base|) .cse8))) (let ((.cse10 (select (select (store .cse11 .cse9 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse8 0)) v_prenex_8 v_ArrVal_846) .cse9 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse10) (= .cse10 v_prenex_8))))))) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse12 (select (select (let ((.cse14 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse14 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~n~0#1.base|) .cse14) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse12 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse12)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse15 (+ v_prenex_10 4))) (let ((.cse21 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse15 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~n~0#1.base|) .cse15))) (let ((.cse18 (select (select (store .cse21 .cse16 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse15 0)) v_prenex_8 v_ArrVal_846) .cse16 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse17 (select (select (let ((.cse20 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse20 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~n~0#1.base|) .cse20) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse17 v_prenex_8) (= .cse18 .cse17) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse18)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse18) (= .cse18 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse25 (+ v_prenex_10 4))) (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse25 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~n~0#1.base|) .cse25))) (let ((.cse24 (select (select (store .cse27 .cse26 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse23 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse22 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse23 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~n~0#1.base|) .cse23) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse24))) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse25 0)) v_prenex_8 v_ArrVal_846) .cse26 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse24) (= .cse24 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse29 (select (select (let ((.cse33 (+ v_prenex_10 4))) (let ((.cse32 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse33 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse32 (select (select .cse32 |c_ULTIMATE.start_main_~n~0#1.base|) .cse33) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse28 (select (select (let ((.cse31 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse31 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse30 (select (select .cse30 |c_ULTIMATE.start_main_~n~0#1.base|) .cse31) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse28 v_prenex_8) (= .cse28 0) (= .cse29 .cse28) (= .cse28 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse28)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse29))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse29) (= .cse29 v_prenex_8)))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse36 (+ v_prenex_10 4))) (let ((.cse38 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse36 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse37 (select (select .cse38 |c_ULTIMATE.start_main_~n~0#1.base|) .cse36))) (let ((.cse35 (select (select (let ((.cse40 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse40 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse39 (select (select .cse39 |c_ULTIMATE.start_main_~n~0#1.base|) .cse40) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse34 (select (select (store .cse38 .cse37 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse34 .cse35) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse35) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse36 0)) v_prenex_8 v_ArrVal_846) .cse37 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse34) (= .cse34 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse42 (select (select (let ((.cse46 (+ v_prenex_10 4))) (let ((.cse45 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse46 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse45 (select (select .cse45 |c_ULTIMATE.start_main_~n~0#1.base|) .cse46) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse41 (select (select (let ((.cse44 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse43 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse44 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse43 (select (select .cse43 |c_ULTIMATE.start_main_~n~0#1.base|) .cse44) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse41 0) (= .cse42 .cse41) (= .cse41 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse41)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse42)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse47 (+ v_prenex_10 4))) (let ((.cse53 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse47 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_main_~n~0#1.base|) .cse47))) (let ((.cse50 (select (select (store .cse53 .cse48 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse47 0)) v_prenex_8 v_ArrVal_846) .cse48 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse49 (select (select (let ((.cse52 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse51 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse52 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse51 (select (select .cse51 |c_ULTIMATE.start_main_~n~0#1.base|) .cse52) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse49) (= .cse50 .cse49) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse49) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse50) (= .cse50 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse60 (+ v_prenex_10 4))) (let ((.cse58 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse60 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse59 (select (select .cse58 |c_ULTIMATE.start_main_~n~0#1.base|) .cse60))) (or (forall ((v_prenex_9 (Array Int Int))) (let ((.cse55 (select (select (store .cse58 .cse59 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse54 (select (select (let ((.cse57 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse56 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse57 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse56 (select (select .cse56 |c_ULTIMATE.start_main_~n~0#1.base|) .cse57) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse54 v_prenex_8) (= .cse55 .cse54) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse54)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse55) (= .cse55 v_prenex_8)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse60 0)) v_prenex_8 v_ArrVal_846) .cse59 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse62 (select (select (let ((.cse66 (+ v_prenex_10 4))) (let ((.cse65 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse66 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse65 (select (select .cse65 |c_ULTIMATE.start_main_~n~0#1.base|) .cse66) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse61 (select (select (let ((.cse64 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse63 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse64 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse63 (select (select .cse63 |c_ULTIMATE.start_main_~n~0#1.base|) .cse64) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse61 v_prenex_8) (= .cse61 0) (= .cse61 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse61) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse62)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse62) (= .cse62 v_prenex_8)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse69 (+ v_prenex_10 4))) (let ((.cse71 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse69 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse70 (select (select .cse71 |c_ULTIMATE.start_main_~n~0#1.base|) .cse69))) (let ((.cse67 (select (select (let ((.cse73 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse72 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse73 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse72 (select (select .cse72 |c_ULTIMATE.start_main_~n~0#1.base|) .cse73) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse68 (select (select (store .cse71 .cse70 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse67) (= .cse67 v_prenex_8) (= .cse68 .cse67) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse67) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse69 0)) v_prenex_8 v_ArrVal_846) .cse70 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse68) (= .cse68 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse77 (+ v_prenex_10 4))) (let ((.cse80 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse77 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse78 (select (select .cse80 |c_ULTIMATE.start_main_~n~0#1.base|) .cse77))) (let ((.cse79 (select (select (store .cse80 .cse78 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse74 (select (select (let ((.cse76 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse75 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse76 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse75 (select (select .cse75 |c_ULTIMATE.start_main_~n~0#1.base|) .cse76) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse74 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse74)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse77 0)) v_prenex_8 v_ArrVal_846) .cse78 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse79) (= .cse79 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse87 (+ v_prenex_10 4))) (let ((.cse85 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse87 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse86 (select (select .cse85 |c_ULTIMATE.start_main_~n~0#1.base|) .cse87))) (or (forall ((v_prenex_9 (Array Int Int))) (let ((.cse82 (select (select (store .cse85 .cse86 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse81 (select (select (let ((.cse84 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse83 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse84 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse83 (select (select .cse83 |c_ULTIMATE.start_main_~n~0#1.base|) .cse84) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse81) (= .cse81 v_prenex_8) (= .cse82 .cse81) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse82) (= .cse82 v_prenex_8)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse87 0)) v_prenex_8 v_ArrVal_846) .cse86 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse90 (+ v_prenex_10 4))) (let ((.cse92 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse90 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse91 (select (select .cse92 |c_ULTIMATE.start_main_~n~0#1.base|) .cse90))) (let ((.cse88 (select (select (let ((.cse94 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse93 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse94 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse93 (select (select .cse93 |c_ULTIMATE.start_main_~n~0#1.base|) .cse94) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse89 (select (select (store .cse92 .cse91 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse88) (= .cse88 v_prenex_8) (= .cse89 .cse88) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse90 0)) v_prenex_8 v_ArrVal_846) .cse91 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse89) (= .cse89 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse96 (select (select (let ((.cse100 (+ v_prenex_10 4))) (let ((.cse99 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse100 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse99 (select (select .cse99 |c_ULTIMATE.start_main_~n~0#1.base|) .cse100) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse95 (select (select (let ((.cse98 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse97 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse98 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse97 (select (select .cse97 |c_ULTIMATE.start_main_~n~0#1.base|) .cse98) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse95 0) (= .cse95 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse95) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse96)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse96)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse103 (+ v_prenex_10 4))) (let ((.cse105 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse103 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse104 (select (select .cse105 |c_ULTIMATE.start_main_~n~0#1.base|) .cse103))) (let ((.cse101 (select (select (let ((.cse107 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse106 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse107 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse106 (select (select .cse106 |c_ULTIMATE.start_main_~n~0#1.base|) .cse107) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse102 (select (select (store .cse105 .cse104 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse101) (= .cse101 v_prenex_8) (= .cse102 .cse101) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse101) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse103 0)) v_prenex_8 v_ArrVal_846) .cse104 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse102) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse102) (= .cse102 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse114 (+ v_prenex_10 4))) (let ((.cse112 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse114 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse113 (select (select .cse112 |c_ULTIMATE.start_main_~n~0#1.base|) .cse114))) (or (forall ((v_prenex_9 (Array Int Int))) (let ((.cse109 (select (select (store .cse112 .cse113 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse108 (select (select (let ((.cse111 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse110 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse111 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse110 (select (select .cse110 |c_ULTIMATE.start_main_~n~0#1.base|) .cse111) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse108) (= .cse108 v_prenex_8) (= .cse109 .cse108) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse108) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse109) (= .cse109 v_prenex_8)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse114 0)) v_prenex_8 v_ArrVal_846) .cse113 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse119 (+ v_prenex_10 4))) (let ((.cse121 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse119 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse120 (select (select .cse121 |c_ULTIMATE.start_main_~n~0#1.base|) .cse119))) (let ((.cse116 (select (select (store .cse121 .cse120 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse115 (select (select (let ((.cse118 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse117 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse118 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse117 (select (select .cse117 |c_ULTIMATE.start_main_~n~0#1.base|) .cse118) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse115 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse115) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse116)))) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse119 0)) v_prenex_8 v_ArrVal_846) .cse120 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse116) (= .cse116 v_prenex_8))))))))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse122 (+ v_prenex_10 4))) (let ((.cse128 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse122 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse123 (select (select .cse128 |c_ULTIMATE.start_main_~n~0#1.base|) .cse122))) (let ((.cse124 (select (select (store .cse128 .cse123 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse122 0)) v_prenex_8 v_ArrVal_846) .cse123 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse124) (= .cse124 v_prenex_8) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse125 (select (select (let ((.cse127 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse126 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse127 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse126 (select (select .cse126 |c_ULTIMATE.start_main_~n~0#1.base|) .cse127) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse125) (= .cse125 v_prenex_8) (= .cse124 .cse125) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse124)))))))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse131 (+ v_prenex_10 4))) (let ((.cse133 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse131 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse132 (select (select .cse133 |c_ULTIMATE.start_main_~n~0#1.base|) .cse131))) (let ((.cse129 (select (select (let ((.cse135 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse134 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse135 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse134 (select (select .cse134 |c_ULTIMATE.start_main_~n~0#1.base|) .cse135) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse130 (select (select (store .cse133 .cse132 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse129 v_prenex_8) (= .cse130 .cse129) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse129) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse131 0)) v_prenex_8 v_ArrVal_846) .cse132 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse130) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse130) (= .cse130 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse137 (select (select (let ((.cse141 (+ v_prenex_10 4))) (let ((.cse140 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse141 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse140 (select (select .cse140 |c_ULTIMATE.start_main_~n~0#1.base|) .cse141) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse136 (select (select (let ((.cse139 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse138 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse139 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse138 (select (select .cse138 |c_ULTIMATE.start_main_~n~0#1.base|) .cse139) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse136 v_prenex_8) (= .cse136 0) (= .cse137 .cse136) (= .cse136 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse136)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse137) (= .cse137 v_prenex_8)))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse143 (select (select (let ((.cse147 (+ v_prenex_10 4))) (let ((.cse146 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse147 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse146 (select (select .cse146 |c_ULTIMATE.start_main_~n~0#1.base|) .cse147) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse142 (select (select (let ((.cse145 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse144 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse145 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse144 (select (select .cse144 |c_ULTIMATE.start_main_~n~0#1.base|) .cse145) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse142 v_prenex_8) (= .cse142 0) (= .cse142 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse142) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse143)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse143)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse148 (+ v_prenex_10 4))) (let ((.cse154 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse148 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse149 (select (select .cse154 |c_ULTIMATE.start_main_~n~0#1.base|) .cse148))) (let ((.cse151 (select (select (store .cse154 .cse149 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse148 0)) v_prenex_8 v_ArrVal_846) .cse149 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse150 (select (select (let ((.cse153 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse152 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse153 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse152 (select (select .cse152 |c_ULTIMATE.start_main_~n~0#1.base|) .cse153) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse150 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse150) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse151)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse151) (= .cse151 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse157 (+ v_prenex_10 4))) (let ((.cse159 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse157 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse158 (select (select .cse159 |c_ULTIMATE.start_main_~n~0#1.base|) .cse157))) (let ((.cse155 (select (select (let ((.cse161 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse160 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse161 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse160 (select (select .cse160 |c_ULTIMATE.start_main_~n~0#1.base|) .cse161) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse156 (select (select (store .cse159 .cse158 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse155 v_prenex_8) (= .cse156 .cse155) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse155) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse157 0)) v_prenex_8 v_ArrVal_846) .cse158 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse156) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse156) (= .cse156 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse163 (select (select (let ((.cse167 (+ v_prenex_10 4))) (let ((.cse166 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse167 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse166 (select (select .cse166 |c_ULTIMATE.start_main_~n~0#1.base|) .cse167) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse162 (select (select (let ((.cse165 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse164 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse165 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse164 (select (select .cse164 |c_ULTIMATE.start_main_~n~0#1.base|) .cse165) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse162 v_prenex_8) (= .cse162 0) (= .cse163 .cse162) (= .cse162 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse162)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse163))) (= .cse163 v_prenex_8)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse170 (+ v_prenex_10 4))) (let ((.cse172 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse170 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse171 (select (select .cse172 |c_ULTIMATE.start_main_~n~0#1.base|) .cse170))) (let ((.cse168 (select (select (let ((.cse174 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse173 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse174 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse173 (select (select .cse173 |c_ULTIMATE.start_main_~n~0#1.base|) .cse174) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse169 (select (select (store .cse172 .cse171 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse168 v_prenex_8) (= .cse169 .cse168) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse168) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse170 0)) v_prenex_8 v_ArrVal_846) .cse171 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse169) (= .cse169 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse175 (select (select (let ((.cse180 (+ v_prenex_10 4))) (let ((.cse179 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse180 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse179 (select (select .cse179 |c_ULTIMATE.start_main_~n~0#1.base|) .cse180) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~n~0#1.base| .cse175) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse176 (select (select (let ((.cse178 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse177 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse178 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse177 (select (select .cse177 |c_ULTIMATE.start_main_~n~0#1.base|) .cse178) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse176 0) (= .cse175 .cse176) (= .cse176 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse176)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse175)))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse185 (+ v_prenex_10 4))) (let ((.cse187 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse185 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse186 (select (select .cse187 |c_ULTIMATE.start_main_~n~0#1.base|) .cse185))) (let ((.cse182 (select (select (store .cse187 .cse186 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse181 (select (select (let ((.cse184 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse183 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse184 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse183 (select (select .cse183 |c_ULTIMATE.start_main_~n~0#1.base|) .cse184) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse181 v_prenex_8) (= .cse182 .cse181) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse181) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse182)))) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse185 0)) v_prenex_8 v_ArrVal_846) .cse186 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse182) (= .cse182 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse190 (+ v_prenex_10 4))) (let ((.cse192 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse190 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse191 (select (select .cse192 |c_ULTIMATE.start_main_~n~0#1.base|) .cse190))) (let ((.cse188 (select (select (let ((.cse194 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse193 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse194 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse193 (select (select .cse193 |c_ULTIMATE.start_main_~n~0#1.base|) .cse194) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse189 (select (select (store .cse192 .cse191 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse188 v_prenex_8) (= .cse189 .cse188) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse190 0)) v_prenex_8 v_ArrVal_846) .cse191 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse189) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse189) (= .cse189 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse199 (+ v_prenex_10 4))) (let ((.cse201 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse199 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse200 (select (select .cse201 |c_ULTIMATE.start_main_~n~0#1.base|) .cse199))) (let ((.cse196 (select (select (store .cse201 .cse200 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse195 (select (select (let ((.cse198 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse197 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse198 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse197 (select (select .cse197 |c_ULTIMATE.start_main_~n~0#1.base|) .cse198) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse195 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse195) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse196)))) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse199 0)) v_prenex_8 v_ArrVal_846) .cse200 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse196) (= .cse196 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse203 (select (select (let ((.cse207 (+ v_prenex_10 4))) (let ((.cse206 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse207 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse206 (select (select .cse206 |c_ULTIMATE.start_main_~n~0#1.base|) .cse207) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse202 (select (select (let ((.cse205 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse204 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse205 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse204 (select (select .cse204 |c_ULTIMATE.start_main_~n~0#1.base|) .cse205) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse202 v_prenex_8) (= .cse202 0) (= .cse203 .cse202) (= .cse202 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse202)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse203))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse203)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse208 (+ v_prenex_10 4))) (let ((.cse214 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse208 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse209 (select (select .cse214 |c_ULTIMATE.start_main_~n~0#1.base|) .cse208))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse208 0)) v_prenex_8 v_ArrVal_846) .cse209 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (forall ((v_prenex_9 (Array Int Int))) (let ((.cse211 (select (select (store .cse214 .cse209 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse210 (select (select (let ((.cse213 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse212 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse213 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse212 (select (select .cse212 |c_ULTIMATE.start_main_~n~0#1.base|) .cse213) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse210 v_prenex_8) (= .cse211 .cse210) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse210) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse211) (= .cse211 v_prenex_8))))))))))) (forall ((v_prenex_9 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse216 (select (select (let ((.cse220 (+ v_prenex_10 4))) (let ((.cse219 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse220 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse219 (select (select .cse219 |c_ULTIMATE.start_main_~n~0#1.base|) .cse220) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse215 (select (select (let ((.cse218 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse217 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse218 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse217 (select (select .cse217 |c_ULTIMATE.start_main_~n~0#1.base|) .cse218) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse215 v_prenex_8) (= .cse215 0) (= .cse216 .cse215) (= .cse215 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse215)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse216)))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse221 (+ v_prenex_10 4))) (let ((.cse227 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse221 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse222 (select (select .cse227 |c_ULTIMATE.start_main_~n~0#1.base|) .cse221))) (let ((.cse223 (select (select (store .cse227 .cse222 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse221 0)) v_prenex_8 v_ArrVal_846) .cse222 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse224 (select (select (let ((.cse226 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse225 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse226 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse225 (select (select .cse225 |c_ULTIMATE.start_main_~n~0#1.base|) .cse226) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse223 .cse224) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse224) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse223)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse223) (= .cse223 v_prenex_8))))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse229 (select (select (let ((.cse233 (+ v_prenex_10 4))) (let ((.cse232 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse233 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse232 (select (select .cse232 |c_ULTIMATE.start_main_~n~0#1.base|) .cse233) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse228 (select (select (let ((.cse231 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse230 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse231 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse230 (select (select .cse230 |c_ULTIMATE.start_main_~n~0#1.base|) .cse231) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse228 0) (= .cse228 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse228) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse229)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse229)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse234 (select (select (let ((.cse239 (+ v_prenex_10 4))) (let ((.cse238 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse239 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse238 (select (select .cse238 |c_ULTIMATE.start_main_~n~0#1.base|) .cse239) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~n~0#1.base| .cse234) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse235 (select (select (let ((.cse237 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse236 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse237 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse236 (select (select .cse236 |c_ULTIMATE.start_main_~n~0#1.base|) .cse237) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse235 0) (= .cse234 .cse235) (= .cse235 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse235)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse234)))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse240 (select (select (let ((.cse245 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse244 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse245 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse244 (select (select .cse244 |c_ULTIMATE.start_main_~n~0#1.base|) .cse245) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse241 (select (select (let ((.cse243 (+ v_prenex_10 4))) (let ((.cse242 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse243 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse242 (select (select .cse242 |c_ULTIMATE.start_main_~n~0#1.base|) .cse243) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse240 v_prenex_8) (= .cse240 0) (= .cse241 .cse240) (= .cse240 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse240) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse241)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse247 (+ v_prenex_10 4))) (let ((.cse250 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse247 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse248 (select (select .cse250 |c_ULTIMATE.start_main_~n~0#1.base|) .cse247))) (let ((.cse246 (select (select (let ((.cse252 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse251 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse252 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse251 (select (select .cse251 |c_ULTIMATE.start_main_~n~0#1.base|) .cse252) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse249 (select (select (store .cse250 .cse248 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse246) (= .cse246 v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse246) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse247 0)) v_prenex_8 v_ArrVal_846) .cse248 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse249) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse249) (= .cse249 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse253 (select (select (let ((.cse258 (+ v_prenex_10 4))) (let ((.cse257 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse258 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse257 (select (select .cse257 |c_ULTIMATE.start_main_~n~0#1.base|) .cse258) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~n~0#1.base| .cse253) (= .cse253 v_prenex_8) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse254 (select (select (let ((.cse256 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse255 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse256 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse255 (select (select .cse255 |c_ULTIMATE.start_main_~n~0#1.base|) .cse256) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse254 v_prenex_8) (= .cse254 0) (= .cse254 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse254))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse259 (+ v_prenex_10 4))) (let ((.cse264 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse259 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse260 (select (select .cse264 |c_ULTIMATE.start_main_~n~0#1.base|) .cse259))) (let ((.cse261 (select (select (store .cse264 .cse260 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse259 0)) v_prenex_8 v_ArrVal_846) .cse260 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse261) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse263 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse262 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse263 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse262 (select (select .cse262 |c_ULTIMATE.start_main_~n~0#1.base|) .cse263) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse261))) (= .cse261 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse266 (select (select (let ((.cse270 (+ v_prenex_10 4))) (let ((.cse269 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse270 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse269 (select (select .cse269 |c_ULTIMATE.start_main_~n~0#1.base|) .cse270) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse265 (select (select (let ((.cse268 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse267 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse268 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse267 (select (select .cse267 |c_ULTIMATE.start_main_~n~0#1.base|) .cse268) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse265 v_prenex_8) (= .cse265 0) (= .cse266 .cse265) (= .cse265 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse265)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse266))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse266)))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse271 (select (select (let ((.cse273 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse272 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse273 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse272 (select (select .cse272 |c_ULTIMATE.start_main_~n~0#1.base|) .cse273) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse271 0) (= .cse271 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse271)))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse275 (+ v_prenex_10 4))) (let ((.cse274 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse275 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse274 (select (select .cse274 |c_ULTIMATE.start_main_~n~0#1.base|) .cse275) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse278 (+ v_prenex_10 4))) (let ((.cse280 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse278 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse279 (select (select .cse280 |c_ULTIMATE.start_main_~n~0#1.base|) .cse278))) (let ((.cse276 (select (select (let ((.cse282 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse281 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse282 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse281 (select (select .cse281 |c_ULTIMATE.start_main_~n~0#1.base|) .cse282) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse277 (select (select (store .cse280 .cse279 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse276) (= .cse277 .cse276) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse276) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse278 0)) v_prenex_8 v_ArrVal_846) .cse279 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse277) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse277) (= .cse277 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse284 (+ v_prenex_10 4))) (let ((.cse287 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse284 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse285 (select (select .cse287 |c_ULTIMATE.start_main_~n~0#1.base|) .cse284))) (let ((.cse283 (select (select (let ((.cse289 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse288 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse289 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse288 (select (select .cse288 |c_ULTIMATE.start_main_~n~0#1.base|) .cse289) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse286 (select (select (store .cse287 .cse285 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse283) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse283) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse284 0)) v_prenex_8 v_ArrVal_846) .cse285 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse286) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse286) (= .cse286 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse290 (select (select (let ((.cse295 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse294 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse295 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse294 (select (select .cse294 |c_ULTIMATE.start_main_~n~0#1.base|) .cse295) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse291 (select (select (let ((.cse293 (+ v_prenex_10 4))) (let ((.cse292 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse293 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse292 (select (select .cse292 |c_ULTIMATE.start_main_~n~0#1.base|) .cse293) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse290 0) (= .cse291 .cse290) (= .cse290 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse290) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse291)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse296 (+ v_prenex_10 4))) (let ((.cse302 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse296 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse297 (select (select .cse302 |c_ULTIMATE.start_main_~n~0#1.base|) .cse296))) (let ((.cse299 (select (select (store .cse302 .cse297 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse296 0)) v_prenex_8 v_ArrVal_846) .cse297 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse298 (select (select (let ((.cse301 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse300 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse301 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse300 (select (select .cse300 |c_ULTIMATE.start_main_~n~0#1.base|) .cse301) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse298) (= .cse299 .cse298) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse298)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse299) (= .cse299 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse303 (+ v_prenex_10 4))) (let ((.cse309 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse303 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse304 (select (select .cse309 |c_ULTIMATE.start_main_~n~0#1.base|) .cse303))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse303 0)) v_prenex_8 v_ArrVal_846) .cse304 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (forall ((v_prenex_9 (Array Int Int))) (let ((.cse306 (select (select (store .cse309 .cse304 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse305 (select (select (let ((.cse308 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse307 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse308 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse307 (select (select .cse307 |c_ULTIMATE.start_main_~n~0#1.base|) .cse308) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse305) (= .cse305 v_prenex_8) (= .cse306 .cse305) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse305)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse306) (= .cse306 v_prenex_8))))))))))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse316 (+ v_prenex_10 4))) (let ((.cse314 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse316 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse315 (select (select .cse314 |c_ULTIMATE.start_main_~n~0#1.base|) .cse316))) (or (forall ((v_prenex_9 (Array Int Int))) (let ((.cse311 (select (select (store .cse314 .cse315 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse310 (select (select (let ((.cse313 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse312 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse313 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse312 (select (select .cse312 |c_ULTIMATE.start_main_~n~0#1.base|) .cse313) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse310) (= .cse310 v_prenex_8) (= .cse311 .cse310) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse311) (= .cse311 v_prenex_8)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse316 0)) v_prenex_8 v_ArrVal_846) .cse315 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse318 (select (select (let ((.cse322 (+ v_prenex_10 4))) (let ((.cse321 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse322 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse321 (select (select .cse321 |c_ULTIMATE.start_main_~n~0#1.base|) .cse322) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse317 (select (select (let ((.cse320 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse319 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse320 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse319 (select (select .cse319 |c_ULTIMATE.start_main_~n~0#1.base|) .cse320) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse317 0) (= .cse318 .cse317) (= .cse317 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse317)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse318)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse326 (+ v_prenex_10 4))) (let ((.cse329 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse326 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse327 (select (select .cse329 |c_ULTIMATE.start_main_~n~0#1.base|) .cse326))) (let ((.cse328 (select (select (store .cse329 .cse327 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse323 (select (select (let ((.cse325 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse324 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse325 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse324 (select (select .cse324 |c_ULTIMATE.start_main_~n~0#1.base|) .cse325) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse323 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse323) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse326 0)) v_prenex_8 v_ArrVal_846) .cse327 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse328) (= .cse328 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse332 (+ v_prenex_10 4))) (let ((.cse334 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse332 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse333 (select (select .cse334 |c_ULTIMATE.start_main_~n~0#1.base|) .cse332))) (let ((.cse330 (select (select (let ((.cse336 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse335 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse336 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse335 (select (select .cse335 |c_ULTIMATE.start_main_~n~0#1.base|) .cse336) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse331 (select (select (store .cse334 .cse333 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse330 v_prenex_8) (= .cse331 .cse330) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse332 0)) v_prenex_8 v_ArrVal_846) .cse333 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse331) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse331) (= .cse331 v_prenex_8))))))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse338 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse337 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse338 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse337 (select (select .cse337 |c_ULTIMATE.start_main_~n~0#1.base|) .cse338) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse339 (+ v_prenex_10 4))) (let ((.cse342 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse339 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse340 (select (select .cse342 |c_ULTIMATE.start_main_~n~0#1.base|) .cse339))) (let ((.cse341 (select (select (store .cse342 .cse340 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse339 0)) v_prenex_8 v_ArrVal_846) .cse340 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse341) (= .cse341 v_prenex_8)))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse345 (+ v_prenex_10 4))) (let ((.cse347 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse345 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse346 (select (select .cse347 |c_ULTIMATE.start_main_~n~0#1.base|) .cse345))) (let ((.cse343 (select (select (let ((.cse349 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse348 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse349 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse348 (select (select .cse348 |c_ULTIMATE.start_main_~n~0#1.base|) .cse349) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse344 (select (select (store .cse347 .cse346 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse343 v_prenex_8) (= .cse344 .cse343) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse343) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse345 0)) v_prenex_8 v_ArrVal_846) .cse346 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse344) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse344) (= .cse344 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse350 (+ v_prenex_10 4))) (let ((.cse356 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse350 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse351 (select (select .cse356 |c_ULTIMATE.start_main_~n~0#1.base|) .cse350))) (let ((.cse352 (select (select (store .cse356 .cse351 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse350 0)) v_prenex_8 v_ArrVal_846) .cse351 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse353 (select (select (let ((.cse355 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse354 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse355 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse354 (select (select .cse354 |c_ULTIMATE.start_main_~n~0#1.base|) .cse355) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse352 .cse353) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse353) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse352)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse352) (= .cse352 v_prenex_8))))))))))) is different from false [2023-02-15 22:01:15,833 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|))) (and (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (= |c_ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse1 (+ v_prenex_10 4))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse1 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse4 (select (select (let ((.cse6 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse6 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse6) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse4 v_prenex_8) (= .cse4 0) (= .cse4 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse4)))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse8 (+ v_prenex_10 4))) (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse8 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~n~0#1.base|) .cse8))) (let ((.cse10 (select (select (store .cse11 .cse9 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse8 0)) v_prenex_8 v_ArrVal_846) .cse9 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse10) (= .cse10 v_prenex_8))))))) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse12 (select (select (let ((.cse14 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse14 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~n~0#1.base|) .cse14) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse12 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse12)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse15 (+ v_prenex_10 4))) (let ((.cse21 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse15 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~n~0#1.base|) .cse15))) (let ((.cse18 (select (select (store .cse21 .cse16 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse15 0)) v_prenex_8 v_ArrVal_846) .cse16 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse17 (select (select (let ((.cse20 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse20 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~n~0#1.base|) .cse20) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse17 v_prenex_8) (= .cse18 .cse17) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse18)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse18) (= .cse18 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse25 (+ v_prenex_10 4))) (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse25 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~n~0#1.base|) .cse25))) (let ((.cse24 (select (select (store .cse27 .cse26 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse23 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse22 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse23 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~n~0#1.base|) .cse23) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse24))) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse25 0)) v_prenex_8 v_ArrVal_846) .cse26 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse24) (= .cse24 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse29 (select (select (let ((.cse33 (+ v_prenex_10 4))) (let ((.cse32 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse33 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse32 (select (select .cse32 |c_ULTIMATE.start_main_~n~0#1.base|) .cse33) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse28 (select (select (let ((.cse31 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse31 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse30 (select (select .cse30 |c_ULTIMATE.start_main_~n~0#1.base|) .cse31) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse28 v_prenex_8) (= .cse28 0) (= .cse29 .cse28) (= .cse28 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse28)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse29))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse29) (= .cse29 v_prenex_8)))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse36 (+ v_prenex_10 4))) (let ((.cse38 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse36 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse37 (select (select .cse38 |c_ULTIMATE.start_main_~n~0#1.base|) .cse36))) (let ((.cse35 (select (select (let ((.cse40 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse40 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse39 (select (select .cse39 |c_ULTIMATE.start_main_~n~0#1.base|) .cse40) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse34 (select (select (store .cse38 .cse37 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse34 .cse35) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse35) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse36 0)) v_prenex_8 v_ArrVal_846) .cse37 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse34) (= .cse34 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse42 (select (select (let ((.cse46 (+ v_prenex_10 4))) (let ((.cse45 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse46 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse45 (select (select .cse45 |c_ULTIMATE.start_main_~n~0#1.base|) .cse46) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse41 (select (select (let ((.cse44 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse43 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse44 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse43 (select (select .cse43 |c_ULTIMATE.start_main_~n~0#1.base|) .cse44) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse41 0) (= .cse42 .cse41) (= .cse41 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse41)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse42)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse47 (+ v_prenex_10 4))) (let ((.cse53 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse47 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_main_~n~0#1.base|) .cse47))) (let ((.cse50 (select (select (store .cse53 .cse48 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse47 0)) v_prenex_8 v_ArrVal_846) .cse48 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse49 (select (select (let ((.cse52 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse51 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse52 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse51 (select (select .cse51 |c_ULTIMATE.start_main_~n~0#1.base|) .cse52) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse49) (= .cse50 .cse49) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse49) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse50) (= .cse50 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse60 (+ v_prenex_10 4))) (let ((.cse58 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse60 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse59 (select (select .cse58 |c_ULTIMATE.start_main_~n~0#1.base|) .cse60))) (or (forall ((v_prenex_9 (Array Int Int))) (let ((.cse55 (select (select (store .cse58 .cse59 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse54 (select (select (let ((.cse57 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse56 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse57 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse56 (select (select .cse56 |c_ULTIMATE.start_main_~n~0#1.base|) .cse57) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse54 v_prenex_8) (= .cse55 .cse54) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse54)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse55) (= .cse55 v_prenex_8)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse60 0)) v_prenex_8 v_ArrVal_846) .cse59 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse62 (select (select (let ((.cse66 (+ v_prenex_10 4))) (let ((.cse65 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse66 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse65 (select (select .cse65 |c_ULTIMATE.start_main_~n~0#1.base|) .cse66) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse61 (select (select (let ((.cse64 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse63 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse64 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse63 (select (select .cse63 |c_ULTIMATE.start_main_~n~0#1.base|) .cse64) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse61 v_prenex_8) (= .cse61 0) (= .cse61 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse61) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse62)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse62) (= .cse62 v_prenex_8)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse69 (+ v_prenex_10 4))) (let ((.cse71 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse69 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse70 (select (select .cse71 |c_ULTIMATE.start_main_~n~0#1.base|) .cse69))) (let ((.cse67 (select (select (let ((.cse73 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse72 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse73 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse72 (select (select .cse72 |c_ULTIMATE.start_main_~n~0#1.base|) .cse73) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse68 (select (select (store .cse71 .cse70 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse67) (= .cse67 v_prenex_8) (= .cse68 .cse67) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse67) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse69 0)) v_prenex_8 v_ArrVal_846) .cse70 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse68) (= .cse68 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse77 (+ v_prenex_10 4))) (let ((.cse80 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse77 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse78 (select (select .cse80 |c_ULTIMATE.start_main_~n~0#1.base|) .cse77))) (let ((.cse79 (select (select (store .cse80 .cse78 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse74 (select (select (let ((.cse76 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse75 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse76 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse75 (select (select .cse75 |c_ULTIMATE.start_main_~n~0#1.base|) .cse76) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse74 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse74)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse77 0)) v_prenex_8 v_ArrVal_846) .cse78 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse79) (= .cse79 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse87 (+ v_prenex_10 4))) (let ((.cse85 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse87 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse86 (select (select .cse85 |c_ULTIMATE.start_main_~n~0#1.base|) .cse87))) (or (forall ((v_prenex_9 (Array Int Int))) (let ((.cse82 (select (select (store .cse85 .cse86 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse81 (select (select (let ((.cse84 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse83 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse84 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse83 (select (select .cse83 |c_ULTIMATE.start_main_~n~0#1.base|) .cse84) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse81) (= .cse81 v_prenex_8) (= .cse82 .cse81) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse82) (= .cse82 v_prenex_8)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse87 0)) v_prenex_8 v_ArrVal_846) .cse86 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse90 (+ v_prenex_10 4))) (let ((.cse92 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse90 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse91 (select (select .cse92 |c_ULTIMATE.start_main_~n~0#1.base|) .cse90))) (let ((.cse88 (select (select (let ((.cse94 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse93 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse94 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse93 (select (select .cse93 |c_ULTIMATE.start_main_~n~0#1.base|) .cse94) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse89 (select (select (store .cse92 .cse91 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse88) (= .cse88 v_prenex_8) (= .cse89 .cse88) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse90 0)) v_prenex_8 v_ArrVal_846) .cse91 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse89) (= .cse89 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse96 (select (select (let ((.cse100 (+ v_prenex_10 4))) (let ((.cse99 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse100 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse99 (select (select .cse99 |c_ULTIMATE.start_main_~n~0#1.base|) .cse100) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse95 (select (select (let ((.cse98 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse97 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse98 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse97 (select (select .cse97 |c_ULTIMATE.start_main_~n~0#1.base|) .cse98) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse95 0) (= .cse95 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse95) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse96)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse96)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse103 (+ v_prenex_10 4))) (let ((.cse105 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse103 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse104 (select (select .cse105 |c_ULTIMATE.start_main_~n~0#1.base|) .cse103))) (let ((.cse101 (select (select (let ((.cse107 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse106 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse107 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse106 (select (select .cse106 |c_ULTIMATE.start_main_~n~0#1.base|) .cse107) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse102 (select (select (store .cse105 .cse104 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse101) (= .cse101 v_prenex_8) (= .cse102 .cse101) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse101) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse103 0)) v_prenex_8 v_ArrVal_846) .cse104 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse102) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse102) (= .cse102 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse114 (+ v_prenex_10 4))) (let ((.cse112 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse114 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse113 (select (select .cse112 |c_ULTIMATE.start_main_~n~0#1.base|) .cse114))) (or (forall ((v_prenex_9 (Array Int Int))) (let ((.cse109 (select (select (store .cse112 .cse113 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse108 (select (select (let ((.cse111 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse110 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse111 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse110 (select (select .cse110 |c_ULTIMATE.start_main_~n~0#1.base|) .cse111) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse108) (= .cse108 v_prenex_8) (= .cse109 .cse108) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse108) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse109) (= .cse109 v_prenex_8)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse114 0)) v_prenex_8 v_ArrVal_846) .cse113 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse119 (+ v_prenex_10 4))) (let ((.cse121 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse119 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse120 (select (select .cse121 |c_ULTIMATE.start_main_~n~0#1.base|) .cse119))) (let ((.cse116 (select (select (store .cse121 .cse120 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse115 (select (select (let ((.cse118 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse117 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse118 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse117 (select (select .cse117 |c_ULTIMATE.start_main_~n~0#1.base|) .cse118) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse115 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse115) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse116)))) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse119 0)) v_prenex_8 v_ArrVal_846) .cse120 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse116) (= .cse116 v_prenex_8))))))))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse122 (+ v_prenex_10 4))) (let ((.cse128 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse122 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse123 (select (select .cse128 |c_ULTIMATE.start_main_~n~0#1.base|) .cse122))) (let ((.cse124 (select (select (store .cse128 .cse123 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse122 0)) v_prenex_8 v_ArrVal_846) .cse123 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse124) (= .cse124 v_prenex_8) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse125 (select (select (let ((.cse127 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse126 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse127 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse126 (select (select .cse126 |c_ULTIMATE.start_main_~n~0#1.base|) .cse127) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse125) (= .cse125 v_prenex_8) (= .cse124 .cse125) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse124)))))))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse131 (+ v_prenex_10 4))) (let ((.cse133 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse131 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse132 (select (select .cse133 |c_ULTIMATE.start_main_~n~0#1.base|) .cse131))) (let ((.cse129 (select (select (let ((.cse135 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse134 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse135 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse134 (select (select .cse134 |c_ULTIMATE.start_main_~n~0#1.base|) .cse135) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse130 (select (select (store .cse133 .cse132 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse129 v_prenex_8) (= .cse130 .cse129) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse129) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse131 0)) v_prenex_8 v_ArrVal_846) .cse132 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse130) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse130) (= .cse130 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse137 (select (select (let ((.cse141 (+ v_prenex_10 4))) (let ((.cse140 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse141 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse140 (select (select .cse140 |c_ULTIMATE.start_main_~n~0#1.base|) .cse141) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse136 (select (select (let ((.cse139 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse138 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse139 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse138 (select (select .cse138 |c_ULTIMATE.start_main_~n~0#1.base|) .cse139) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse136 v_prenex_8) (= .cse136 0) (= .cse137 .cse136) (= .cse136 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse136)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse137) (= .cse137 v_prenex_8)))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse143 (select (select (let ((.cse147 (+ v_prenex_10 4))) (let ((.cse146 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse147 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse146 (select (select .cse146 |c_ULTIMATE.start_main_~n~0#1.base|) .cse147) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse142 (select (select (let ((.cse145 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse144 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse145 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse144 (select (select .cse144 |c_ULTIMATE.start_main_~n~0#1.base|) .cse145) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse142 v_prenex_8) (= .cse142 0) (= .cse142 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse142) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse143)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse143)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse148 (+ v_prenex_10 4))) (let ((.cse154 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse148 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse149 (select (select .cse154 |c_ULTIMATE.start_main_~n~0#1.base|) .cse148))) (let ((.cse151 (select (select (store .cse154 .cse149 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse148 0)) v_prenex_8 v_ArrVal_846) .cse149 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse150 (select (select (let ((.cse153 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse152 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse153 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse152 (select (select .cse152 |c_ULTIMATE.start_main_~n~0#1.base|) .cse153) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse150 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse150) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse151)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse151) (= .cse151 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse157 (+ v_prenex_10 4))) (let ((.cse159 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse157 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse158 (select (select .cse159 |c_ULTIMATE.start_main_~n~0#1.base|) .cse157))) (let ((.cse155 (select (select (let ((.cse161 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse160 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse161 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse160 (select (select .cse160 |c_ULTIMATE.start_main_~n~0#1.base|) .cse161) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse156 (select (select (store .cse159 .cse158 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse155 v_prenex_8) (= .cse156 .cse155) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse155) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse157 0)) v_prenex_8 v_ArrVal_846) .cse158 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse156) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse156) (= .cse156 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse163 (select (select (let ((.cse167 (+ v_prenex_10 4))) (let ((.cse166 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse167 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse166 (select (select .cse166 |c_ULTIMATE.start_main_~n~0#1.base|) .cse167) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse162 (select (select (let ((.cse165 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse164 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse165 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse164 (select (select .cse164 |c_ULTIMATE.start_main_~n~0#1.base|) .cse165) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse162 v_prenex_8) (= .cse162 0) (= .cse163 .cse162) (= .cse162 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse162)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse163))) (= .cse163 v_prenex_8)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse170 (+ v_prenex_10 4))) (let ((.cse172 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse170 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse171 (select (select .cse172 |c_ULTIMATE.start_main_~n~0#1.base|) .cse170))) (let ((.cse168 (select (select (let ((.cse174 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse173 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse174 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse173 (select (select .cse173 |c_ULTIMATE.start_main_~n~0#1.base|) .cse174) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse169 (select (select (store .cse172 .cse171 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse168 v_prenex_8) (= .cse169 .cse168) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse168) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse170 0)) v_prenex_8 v_ArrVal_846) .cse171 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse169) (= .cse169 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse175 (select (select (let ((.cse180 (+ v_prenex_10 4))) (let ((.cse179 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse180 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse179 (select (select .cse179 |c_ULTIMATE.start_main_~n~0#1.base|) .cse180) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~n~0#1.base| .cse175) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse176 (select (select (let ((.cse178 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse177 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse178 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse177 (select (select .cse177 |c_ULTIMATE.start_main_~n~0#1.base|) .cse178) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse176 0) (= .cse175 .cse176) (= .cse176 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse176)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse175)))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse185 (+ v_prenex_10 4))) (let ((.cse187 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse185 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse186 (select (select .cse187 |c_ULTIMATE.start_main_~n~0#1.base|) .cse185))) (let ((.cse182 (select (select (store .cse187 .cse186 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse181 (select (select (let ((.cse184 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse183 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse184 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse183 (select (select .cse183 |c_ULTIMATE.start_main_~n~0#1.base|) .cse184) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse181 v_prenex_8) (= .cse182 .cse181) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse181) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse182)))) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse185 0)) v_prenex_8 v_ArrVal_846) .cse186 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse182) (= .cse182 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse190 (+ v_prenex_10 4))) (let ((.cse192 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse190 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse191 (select (select .cse192 |c_ULTIMATE.start_main_~n~0#1.base|) .cse190))) (let ((.cse188 (select (select (let ((.cse194 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse193 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse194 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse193 (select (select .cse193 |c_ULTIMATE.start_main_~n~0#1.base|) .cse194) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse189 (select (select (store .cse192 .cse191 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse188 v_prenex_8) (= .cse189 .cse188) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse190 0)) v_prenex_8 v_ArrVal_846) .cse191 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse189) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse189) (= .cse189 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse199 (+ v_prenex_10 4))) (let ((.cse201 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse199 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse200 (select (select .cse201 |c_ULTIMATE.start_main_~n~0#1.base|) .cse199))) (let ((.cse196 (select (select (store .cse201 .cse200 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse195 (select (select (let ((.cse198 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse197 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse198 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse197 (select (select .cse197 |c_ULTIMATE.start_main_~n~0#1.base|) .cse198) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse195 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse195) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse196)))) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse199 0)) v_prenex_8 v_ArrVal_846) .cse200 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse196) (= .cse196 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse203 (select (select (let ((.cse207 (+ v_prenex_10 4))) (let ((.cse206 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse207 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse206 (select (select .cse206 |c_ULTIMATE.start_main_~n~0#1.base|) .cse207) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse202 (select (select (let ((.cse205 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse204 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse205 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse204 (select (select .cse204 |c_ULTIMATE.start_main_~n~0#1.base|) .cse205) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse202 v_prenex_8) (= .cse202 0) (= .cse203 .cse202) (= .cse202 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse202)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse203))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse203)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse208 (+ v_prenex_10 4))) (let ((.cse214 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse208 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse209 (select (select .cse214 |c_ULTIMATE.start_main_~n~0#1.base|) .cse208))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse208 0)) v_prenex_8 v_ArrVal_846) .cse209 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (forall ((v_prenex_9 (Array Int Int))) (let ((.cse211 (select (select (store .cse214 .cse209 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse210 (select (select (let ((.cse213 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse212 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse213 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse212 (select (select .cse212 |c_ULTIMATE.start_main_~n~0#1.base|) .cse213) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse210 v_prenex_8) (= .cse211 .cse210) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse210) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse211) (= .cse211 v_prenex_8))))))))))) (forall ((v_prenex_9 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse216 (select (select (let ((.cse220 (+ v_prenex_10 4))) (let ((.cse219 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse220 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse219 (select (select .cse219 |c_ULTIMATE.start_main_~n~0#1.base|) .cse220) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse215 (select (select (let ((.cse218 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse217 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse218 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse217 (select (select .cse217 |c_ULTIMATE.start_main_~n~0#1.base|) .cse218) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse215 v_prenex_8) (= .cse215 0) (= .cse216 .cse215) (= .cse215 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse215)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse216)))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse221 (+ v_prenex_10 4))) (let ((.cse227 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse221 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse222 (select (select .cse227 |c_ULTIMATE.start_main_~n~0#1.base|) .cse221))) (let ((.cse223 (select (select (store .cse227 .cse222 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse221 0)) v_prenex_8 v_ArrVal_846) .cse222 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse224 (select (select (let ((.cse226 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse225 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse226 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse225 (select (select .cse225 |c_ULTIMATE.start_main_~n~0#1.base|) .cse226) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse223 .cse224) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse224) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse223)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse223) (= .cse223 v_prenex_8))))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse229 (select (select (let ((.cse233 (+ v_prenex_10 4))) (let ((.cse232 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse233 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse232 (select (select .cse232 |c_ULTIMATE.start_main_~n~0#1.base|) .cse233) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse228 (select (select (let ((.cse231 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse230 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse231 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse230 (select (select .cse230 |c_ULTIMATE.start_main_~n~0#1.base|) .cse231) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse228 0) (= .cse228 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse228) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse229)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse229)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse234 (select (select (let ((.cse239 (+ v_prenex_10 4))) (let ((.cse238 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse239 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse238 (select (select .cse238 |c_ULTIMATE.start_main_~n~0#1.base|) .cse239) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~n~0#1.base| .cse234) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse235 (select (select (let ((.cse237 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse236 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse237 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse236 (select (select .cse236 |c_ULTIMATE.start_main_~n~0#1.base|) .cse237) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse235 0) (= .cse234 .cse235) (= .cse235 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse235)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse234)))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse240 (select (select (let ((.cse245 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse244 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse245 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse244 (select (select .cse244 |c_ULTIMATE.start_main_~n~0#1.base|) .cse245) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse241 (select (select (let ((.cse243 (+ v_prenex_10 4))) (let ((.cse242 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse243 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse242 (select (select .cse242 |c_ULTIMATE.start_main_~n~0#1.base|) .cse243) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse240 v_prenex_8) (= .cse240 0) (= .cse241 .cse240) (= .cse240 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse240) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse241)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse247 (+ v_prenex_10 4))) (let ((.cse250 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse247 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse248 (select (select .cse250 |c_ULTIMATE.start_main_~n~0#1.base|) .cse247))) (let ((.cse246 (select (select (let ((.cse252 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse251 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse252 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse251 (select (select .cse251 |c_ULTIMATE.start_main_~n~0#1.base|) .cse252) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse249 (select (select (store .cse250 .cse248 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse246) (= .cse246 v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse246) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse247 0)) v_prenex_8 v_ArrVal_846) .cse248 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse249) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse249) (= .cse249 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse253 (select (select (let ((.cse258 (+ v_prenex_10 4))) (let ((.cse257 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse258 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse257 (select (select .cse257 |c_ULTIMATE.start_main_~n~0#1.base|) .cse258) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~n~0#1.base| .cse253) (= .cse253 v_prenex_8) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse254 (select (select (let ((.cse256 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse255 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse256 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse255 (select (select .cse255 |c_ULTIMATE.start_main_~n~0#1.base|) .cse256) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse254 v_prenex_8) (= .cse254 0) (= .cse254 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse254))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse259 (+ v_prenex_10 4))) (let ((.cse264 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse259 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse260 (select (select .cse264 |c_ULTIMATE.start_main_~n~0#1.base|) .cse259))) (let ((.cse261 (select (select (store .cse264 .cse260 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse259 0)) v_prenex_8 v_ArrVal_846) .cse260 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse261) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse263 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse262 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse263 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse262 (select (select .cse262 |c_ULTIMATE.start_main_~n~0#1.base|) .cse263) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse261))) (= .cse261 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse266 (select (select (let ((.cse270 (+ v_prenex_10 4))) (let ((.cse269 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse270 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse269 (select (select .cse269 |c_ULTIMATE.start_main_~n~0#1.base|) .cse270) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse265 (select (select (let ((.cse268 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse267 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse268 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse267 (select (select .cse267 |c_ULTIMATE.start_main_~n~0#1.base|) .cse268) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse265 v_prenex_8) (= .cse265 0) (= .cse266 .cse265) (= .cse265 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse265)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse266))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse266)))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse271 (select (select (let ((.cse273 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse272 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse273 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse272 (select (select .cse272 |c_ULTIMATE.start_main_~n~0#1.base|) .cse273) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse271 0) (= .cse271 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse271)))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse275 (+ v_prenex_10 4))) (let ((.cse274 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse275 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse274 (select (select .cse274 |c_ULTIMATE.start_main_~n~0#1.base|) .cse275) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse278 (+ v_prenex_10 4))) (let ((.cse280 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse278 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse279 (select (select .cse280 |c_ULTIMATE.start_main_~n~0#1.base|) .cse278))) (let ((.cse276 (select (select (let ((.cse282 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse281 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse282 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse281 (select (select .cse281 |c_ULTIMATE.start_main_~n~0#1.base|) .cse282) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse277 (select (select (store .cse280 .cse279 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse276) (= .cse277 .cse276) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse276) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse278 0)) v_prenex_8 v_ArrVal_846) .cse279 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse277) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse277) (= .cse277 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse284 (+ v_prenex_10 4))) (let ((.cse287 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse284 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse285 (select (select .cse287 |c_ULTIMATE.start_main_~n~0#1.base|) .cse284))) (let ((.cse283 (select (select (let ((.cse289 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse288 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse289 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse288 (select (select .cse288 |c_ULTIMATE.start_main_~n~0#1.base|) .cse289) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse286 (select (select (store .cse287 .cse285 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse283) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse283) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse284 0)) v_prenex_8 v_ArrVal_846) .cse285 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse286) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse286) (= .cse286 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse290 (select (select (let ((.cse295 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse294 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse295 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse294 (select (select .cse294 |c_ULTIMATE.start_main_~n~0#1.base|) .cse295) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse291 (select (select (let ((.cse293 (+ v_prenex_10 4))) (let ((.cse292 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse293 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse292 (select (select .cse292 |c_ULTIMATE.start_main_~n~0#1.base|) .cse293) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse290 0) (= .cse291 .cse290) (= .cse290 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse290) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse291)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse296 (+ v_prenex_10 4))) (let ((.cse302 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse296 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse297 (select (select .cse302 |c_ULTIMATE.start_main_~n~0#1.base|) .cse296))) (let ((.cse299 (select (select (store .cse302 .cse297 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse296 0)) v_prenex_8 v_ArrVal_846) .cse297 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse298 (select (select (let ((.cse301 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse300 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse301 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse300 (select (select .cse300 |c_ULTIMATE.start_main_~n~0#1.base|) .cse301) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse298) (= .cse299 .cse298) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse298)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse299) (= .cse299 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse303 (+ v_prenex_10 4))) (let ((.cse309 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse303 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse304 (select (select .cse309 |c_ULTIMATE.start_main_~n~0#1.base|) .cse303))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse303 0)) v_prenex_8 v_ArrVal_846) .cse304 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (forall ((v_prenex_9 (Array Int Int))) (let ((.cse306 (select (select (store .cse309 .cse304 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse305 (select (select (let ((.cse308 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse307 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse308 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse307 (select (select .cse307 |c_ULTIMATE.start_main_~n~0#1.base|) .cse308) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse305) (= .cse305 v_prenex_8) (= .cse306 .cse305) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse305)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse306) (= .cse306 v_prenex_8))))))))))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse316 (+ v_prenex_10 4))) (let ((.cse314 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse316 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse315 (select (select .cse314 |c_ULTIMATE.start_main_~n~0#1.base|) .cse316))) (or (forall ((v_prenex_9 (Array Int Int))) (let ((.cse311 (select (select (store .cse314 .cse315 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse310 (select (select (let ((.cse313 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse312 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse313 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse312 (select (select .cse312 |c_ULTIMATE.start_main_~n~0#1.base|) .cse313) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse310) (= .cse310 v_prenex_8) (= .cse311 .cse310) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse311) (= .cse311 v_prenex_8)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse316 0)) v_prenex_8 v_ArrVal_846) .cse315 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse318 (select (select (let ((.cse322 (+ v_prenex_10 4))) (let ((.cse321 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse322 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse321 (select (select .cse321 |c_ULTIMATE.start_main_~n~0#1.base|) .cse322) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse317 (select (select (let ((.cse320 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse319 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse320 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse319 (select (select .cse319 |c_ULTIMATE.start_main_~n~0#1.base|) .cse320) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse317 0) (= .cse318 .cse317) (= .cse317 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse317)))) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse318)))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse326 (+ v_prenex_10 4))) (let ((.cse329 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse326 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse327 (select (select .cse329 |c_ULTIMATE.start_main_~n~0#1.base|) .cse326))) (let ((.cse328 (select (select (store .cse329 .cse327 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse323 (select (select (let ((.cse325 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse324 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse325 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse324 (select (select .cse324 |c_ULTIMATE.start_main_~n~0#1.base|) .cse325) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse323 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse323) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse326 0)) v_prenex_8 v_ArrVal_846) .cse327 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse328) (= .cse328 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse332 (+ v_prenex_10 4))) (let ((.cse334 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse332 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse333 (select (select .cse334 |c_ULTIMATE.start_main_~n~0#1.base|) .cse332))) (let ((.cse330 (select (select (let ((.cse336 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse335 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse336 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse335 (select (select .cse335 |c_ULTIMATE.start_main_~n~0#1.base|) .cse336) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse331 (select (select (store .cse334 .cse333 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse330 v_prenex_8) (= .cse331 .cse330) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse332 0)) v_prenex_8 v_ArrVal_846) .cse333 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse331) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse331) (= .cse331 v_prenex_8))))))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse338 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse337 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse338 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse337 (select (select .cse337 |c_ULTIMATE.start_main_~n~0#1.base|) .cse338) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse339 (+ v_prenex_10 4))) (let ((.cse342 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse339 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse340 (select (select .cse342 |c_ULTIMATE.start_main_~n~0#1.base|) .cse339))) (let ((.cse341 (select (select (store .cse342 .cse340 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse339 0)) v_prenex_8 v_ArrVal_846) .cse340 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse341) (= .cse341 v_prenex_8)))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse345 (+ v_prenex_10 4))) (let ((.cse347 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse345 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse346 (select (select .cse347 |c_ULTIMATE.start_main_~n~0#1.base|) .cse345))) (let ((.cse343 (select (select (let ((.cse349 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse348 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse349 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse348 (select (select .cse348 |c_ULTIMATE.start_main_~n~0#1.base|) .cse349) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (.cse344 (select (select (store .cse347 .cse346 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse343 v_prenex_8) (= .cse344 .cse343) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse343) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse345 0)) v_prenex_8 v_ArrVal_846) .cse346 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse344) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse344) (= .cse344 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~n~0#1.base| v_prenex_8) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse350 (+ v_prenex_10 4))) (let ((.cse356 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse350 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse351 (select (select .cse356 |c_ULTIMATE.start_main_~n~0#1.base|) .cse350))) (let ((.cse352 (select (select (store .cse356 .cse351 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse7 .cse350 0)) v_prenex_8 v_ArrVal_846) .cse351 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse353 (select (select (let ((.cse355 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse354 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse355 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse354 (select (select .cse354 |c_ULTIMATE.start_main_~n~0#1.base|) .cse355) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (or (= .cse352 .cse353) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~n~0#1.base|) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse353) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse352)))) (= |c_ULTIMATE.start_main_~n~0#1.base| .cse352) (= .cse352 v_prenex_8))))))))))) is different from true [2023-02-15 22:01:22,406 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse243 (select (select (let ((.cse245 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse244 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse245 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse244 (select (select .cse244 |c_ULTIMATE.start_main_~root~0#1.base|) .cse245) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse243 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse243) (= .cse243 0) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|))))) (.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base|))) (and (or .cse0 (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| (select (select (let ((.cse2 (+ v_prenex_10 4))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse2 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8)))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse5 (select (select (let ((.cse10 (+ v_prenex_10 4))) (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse10 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~root~0#1.base|) .cse10) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse5) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse6 (select (select (let ((.cse8 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse8 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~root~0#1.base|) .cse8) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse5) (= .cse6 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse6) (= .cse6 0) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse13 (+ v_prenex_10 4))) (let ((.cse15 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse13 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~root~0#1.base|) .cse13))) (let ((.cse11 (select (select (store .cse15 .cse14 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse11) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse13 0)) v_prenex_8 v_ArrVal_846) .cse14 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0)) (= .cse11 v_prenex_8) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse11) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|))))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse16 (select (select (let ((.cse18 (+ v_prenex_10 4))) (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse18 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~root~0#1.base|) .cse18) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse16) .cse0 (= .cse16 v_prenex_8)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse19 (+ v_prenex_10 4))) (let ((.cse24 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse19 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse20 (select (select .cse24 |c_ULTIMATE.start_main_~root~0#1.base|) .cse19))) (let ((.cse21 (select (select (store .cse24 .cse20 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse19 0)) v_prenex_8 v_ArrVal_846) .cse20 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse21) (= .cse21 v_prenex_8) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= (select (select (let ((.cse23 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse22 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse23 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~root~0#1.base|) .cse23) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) v_prenex_8))))))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse25 (+ v_prenex_10 4))) (let ((.cse31 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse25 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse26 (select (select .cse31 |c_ULTIMATE.start_main_~root~0#1.base|) .cse25))) (let ((.cse27 (select (select (store .cse31 .cse26 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (.cse28 (select (select (let ((.cse30 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse29 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse30 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~root~0#1.base|) .cse30) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse25 0)) v_prenex_8 v_ArrVal_846) .cse26 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse27) (= .cse27 .cse28) (= .cse27 v_prenex_8) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse28) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8) (= .cse28 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse32 (select (select (let ((.cse34 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse33 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse34 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~root~0#1.base|) .cse34) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse32 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse32) (= .cse32 0) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8)))) (= |c_ULTIMATE.start_main_~root~0#1.base| (select (select (let ((.cse36 (+ v_prenex_10 4))) (let ((.cse35 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse36 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse35 (select (select .cse35 |c_ULTIMATE.start_main_~root~0#1.base|) .cse36) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)))))) (forall ((v_prenex_9 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse37 (select (select (let ((.cse42 (+ v_prenex_10 4))) (let ((.cse41 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse42 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse41 (select (select .cse41 |c_ULTIMATE.start_main_~root~0#1.base|) .cse42) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse37) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse38 (select (select (let ((.cse40 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse40 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse39 (select (select .cse39 |c_ULTIMATE.start_main_~root~0#1.base|) .cse40) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse37 .cse38) (= .cse38 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse38) (= .cse38 0))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse43 (+ v_prenex_10 4))) (let ((.cse49 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse43 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse44 (select (select .cse49 |c_ULTIMATE.start_main_~root~0#1.base|) .cse43))) (let ((.cse45 (select (select (store .cse49 .cse44 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (.cse46 (select (select (let ((.cse48 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse47 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse48 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse47 (select (select .cse47 |c_ULTIMATE.start_main_~root~0#1.base|) .cse48) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse43 0)) v_prenex_8 v_ArrVal_846) .cse44 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse45) (= .cse45 .cse46) (= .cse45 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= .cse46 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse51 (+ v_prenex_10 4))) (let ((.cse53 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse51 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse52 (select (select .cse53 |c_ULTIMATE.start_main_~root~0#1.base|) .cse51))) (let ((.cse50 (select (select (store .cse53 .cse52 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse50) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse51 0)) v_prenex_8 v_ArrVal_846) .cse52 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0)) (= .cse50 v_prenex_8) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse50) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8))))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse54 (select (select (let ((.cse59 (+ v_prenex_10 4))) (let ((.cse58 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse59 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse58 (select (select .cse58 |c_ULTIMATE.start_main_~root~0#1.base|) .cse59) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse54) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse54) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse55 (select (select (let ((.cse57 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse56 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse57 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse56 (select (select .cse56 |c_ULTIMATE.start_main_~root~0#1.base|) .cse57) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse54 .cse55) (= .cse55 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse55) (= .cse55 0)))))) (= .cse54 v_prenex_8)))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse60 (select (select (let ((.cse65 (+ v_prenex_10 4))) (let ((.cse64 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse65 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse64 (select (select .cse64 |c_ULTIMATE.start_main_~root~0#1.base|) .cse65) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse60) (= .cse60 v_prenex_8) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse61 (select (select (let ((.cse63 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse62 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse63 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse62 (select (select .cse62 |c_ULTIMATE.start_main_~root~0#1.base|) .cse63) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse60) (= .cse61 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse61) (= .cse61 0) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|))))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse66 (+ v_prenex_10 4))) (let ((.cse72 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse66 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse67 (select (select .cse72 |c_ULTIMATE.start_main_~root~0#1.base|) .cse66))) (let ((.cse68 (select (select (store .cse72 .cse67 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (.cse69 (select (select (let ((.cse71 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse70 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse71 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse70 (select (select .cse70 |c_ULTIMATE.start_main_~root~0#1.base|) .cse71) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse66 0)) v_prenex_8 v_ArrVal_846) .cse67 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse68) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse69) (= .cse68 v_prenex_8) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= .cse69 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse73 (+ v_prenex_10 4))) (let ((.cse78 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse73 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse74 (select (select .cse78 |c_ULTIMATE.start_main_~root~0#1.base|) .cse73))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse73 0)) v_prenex_8 v_ArrVal_846) .cse74 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (forall ((v_prenex_9 (Array Int Int))) (let ((.cse75 (select (select (store .cse78 .cse74 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse75) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (or (= .cse75 (select (select (let ((.cse77 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse76 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse77 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse76 (select (select .cse76 |c_ULTIMATE.start_main_~root~0#1.base|) .cse77) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8))) (= .cse75 v_prenex_8))))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse79 (+ v_prenex_10 4))) (let ((.cse84 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse79 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse80 (select (select .cse84 |c_ULTIMATE.start_main_~root~0#1.base|) .cse79))) (let ((.cse81 (select (select (store .cse84 .cse80 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse79 0)) v_prenex_8 v_ArrVal_846) .cse80 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse81) (= .cse81 (select (select (let ((.cse83 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse82 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse83 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse82 (select (select .cse82 |c_ULTIMATE.start_main_~root~0#1.base|) .cse83) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (= .cse81 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse86 (+ v_prenex_10 4))) (let ((.cse91 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse86 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse87 (select (select .cse91 |c_ULTIMATE.start_main_~root~0#1.base|) .cse86))) (let ((.cse85 (select (select (store .cse91 .cse87 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (.cse88 (select (select (let ((.cse90 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse89 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse90 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse89 (select (select .cse89 |c_ULTIMATE.start_main_~root~0#1.base|) .cse90) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse85) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse86 0)) v_prenex_8 v_ArrVal_846) .cse87 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= .cse85 .cse88) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse88) (= .cse85 v_prenex_8) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8) (= .cse88 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse95 (+ v_prenex_10 4))) (let ((.cse97 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse95 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse96 (select (select .cse97 |c_ULTIMATE.start_main_~root~0#1.base|) .cse95))) (let ((.cse92 (select (select (store .cse97 .cse96 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse92) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse92) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= (select (select (let ((.cse94 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse93 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse94 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse93 (select (select .cse93 |c_ULTIMATE.start_main_~root~0#1.base|) .cse94) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) v_prenex_8))) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse95 0)) v_prenex_8 v_ArrVal_846) .cse96 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0)) (= .cse92 v_prenex_8) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8) (forall ((v_prenex_9 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse98 (select (select (let ((.cse103 (+ v_prenex_10 4))) (let ((.cse102 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse103 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse102 (select (select .cse102 |c_ULTIMATE.start_main_~root~0#1.base|) .cse103) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse98) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse99 (select (select (let ((.cse101 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse100 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse101 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse100 (select (select .cse100 |c_ULTIMATE.start_main_~root~0#1.base|) .cse101) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse98 .cse99) (= .cse99 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse99) (= .cse99 0))))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (= |c_ULTIMATE.start_main_~root~0#1.base| (select (select (let ((.cse105 (+ v_prenex_10 4))) (let ((.cse104 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse105 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse104 (select (select .cse104 |c_ULTIMATE.start_main_~root~0#1.base|) .cse105) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse106 (select (select (let ((.cse108 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse107 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse108 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse107 (select (select .cse107 |c_ULTIMATE.start_main_~root~0#1.base|) .cse108) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse106 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse106) (= .cse106 0) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= .cse106 v_prenex_8)))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse110 (+ v_prenex_10 4))) (let ((.cse113 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse110 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse111 (select (select .cse113 |c_ULTIMATE.start_main_~root~0#1.base|) .cse110))) (let ((.cse112 (select (select (let ((.cse115 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse114 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse115 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse114 (select (select .cse114 |c_ULTIMATE.start_main_~root~0#1.base|) .cse115) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (.cse109 (select (select (store .cse113 .cse111 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse109) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse110 0)) v_prenex_8 v_ArrVal_846) .cse111 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= .cse109 .cse112) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse112) (= .cse109 v_prenex_8) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse119 (+ v_prenex_10 4))) (let ((.cse121 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse119 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse120 (select (select .cse121 |c_ULTIMATE.start_main_~root~0#1.base|) .cse119))) (let ((.cse116 (select (select (store .cse121 .cse120 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse116) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (or (= .cse116 (select (select (let ((.cse118 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse117 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse118 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse117 (select (select .cse117 |c_ULTIMATE.start_main_~root~0#1.base|) .cse118) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8))) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse119 0)) v_prenex_8 v_ArrVal_846) .cse120 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0)) (= .cse116 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse122 (+ v_prenex_10 4))) (let ((.cse127 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse122 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse123 (select (select .cse127 |c_ULTIMATE.start_main_~root~0#1.base|) .cse122))) (let ((.cse124 (select (select (store .cse127 .cse123 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse122 0)) v_prenex_8 v_ArrVal_846) .cse123 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse124) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| (select (select (let ((.cse126 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse125 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse126 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse125 (select (select .cse125 |c_ULTIMATE.start_main_~root~0#1.base|) .cse126) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (= .cse124 v_prenex_8) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse128 (select (select (let ((.cse133 (+ v_prenex_10 4))) (let ((.cse132 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse133 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse132 (select (select .cse132 |c_ULTIMATE.start_main_~root~0#1.base|) .cse133) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse128) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse129 (select (select (let ((.cse131 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse130 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse131 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse130 (select (select .cse130 |c_ULTIMATE.start_main_~root~0#1.base|) .cse131) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse128 .cse129) (= .cse129 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse129) (= .cse129 0)))))) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse128)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse134 (+ v_prenex_10 4))) (let ((.cse137 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse134 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse135 (select (select .cse137 |c_ULTIMATE.start_main_~root~0#1.base|) .cse134))) (let ((.cse136 (select (select (store .cse137 .cse135 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse134 0)) v_prenex_8 v_ArrVal_846) .cse135 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse136) (= .cse136 v_prenex_8) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8))))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse138 (select (select (let ((.cse143 (+ v_prenex_10 4))) (let ((.cse142 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse143 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse142 (select (select .cse142 |c_ULTIMATE.start_main_~root~0#1.base|) .cse143) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse138) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse139 (select (select (let ((.cse141 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse140 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse141 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse140 (select (select .cse140 |c_ULTIMATE.start_main_~root~0#1.base|) .cse141) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse138 .cse139) (= .cse139 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse139) (= .cse139 0)))))) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse138)))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse144 (+ v_prenex_10 4))) (let ((.cse150 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse144 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse145 (select (select .cse150 |c_ULTIMATE.start_main_~root~0#1.base|) .cse144))) (let ((.cse146 (select (select (store .cse150 .cse145 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (.cse147 (select (select (let ((.cse149 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse148 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse149 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse148 (select (select .cse148 |c_ULTIMATE.start_main_~root~0#1.base|) .cse149) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse144 0)) v_prenex_8 v_ArrVal_846) .cse145 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse146) (= .cse146 .cse147) (= .cse146 v_prenex_8) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8) (= .cse147 v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse151 (select (select (let ((.cse156 (+ v_prenex_10 4))) (let ((.cse155 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse156 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse155 (select (select .cse155 |c_ULTIMATE.start_main_~root~0#1.base|) .cse156) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse151) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse152 (select (select (let ((.cse154 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse153 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse154 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse153 (select (select .cse153 |c_ULTIMATE.start_main_~root~0#1.base|) .cse154) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse151 .cse152) (= .cse152 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse152) (= .cse152 0)))))) (= .cse151 v_prenex_8)))) (forall ((v_prenex_8 Int)) (or (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse160 (+ v_prenex_10 4))) (let ((.cse162 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse160 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse161 (select (select .cse162 |c_ULTIMATE.start_main_~root~0#1.base|) .cse160))) (let ((.cse157 (select (select (store .cse162 .cse161 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse157) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse157) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= (select (select (let ((.cse159 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse158 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse159 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse158 (select (select .cse158 |c_ULTIMATE.start_main_~root~0#1.base|) .cse159) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) v_prenex_8))) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse160 0)) v_prenex_8 v_ArrVal_846) .cse161 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0)) (= .cse157 v_prenex_8))))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse163 (select (select (let ((.cse168 (+ v_prenex_10 4))) (let ((.cse167 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse168 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse167 (select (select .cse167 |c_ULTIMATE.start_main_~root~0#1.base|) .cse168) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse163) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse163) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse164 (select (select (let ((.cse166 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse165 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse166 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse165 (select (select .cse165 |c_ULTIMATE.start_main_~root~0#1.base|) .cse166) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse163 .cse164) (= .cse164 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse164) (= .cse164 0))))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse169 (select (select (let ((.cse171 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse170 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse171 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse170 (select (select .cse170 |c_ULTIMATE.start_main_~root~0#1.base|) .cse171) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse169 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse169) (= .cse169 0) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_prenex_8) (= .cse169 v_prenex_8)))) (= |c_ULTIMATE.start_main_~root~0#1.base| (select (select (let ((.cse173 (+ v_prenex_10 4))) (let ((.cse172 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse173 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse172 (select (select .cse172 |c_ULTIMATE.start_main_~root~0#1.base|) .cse173) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse178 (+ v_prenex_10 4))) (let ((.cse180 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse178 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse179 (select (select .cse180 |c_ULTIMATE.start_main_~root~0#1.base|) .cse178))) (let ((.cse174 (select (select (store .cse180 .cse179 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse175 (select (select (let ((.cse177 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse176 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse177 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse176 (select (select .cse176 |c_ULTIMATE.start_main_~root~0#1.base|) .cse177) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse174 .cse175) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= .cse175 v_prenex_8)))) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse174) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse178 0)) v_prenex_8 v_ArrVal_846) .cse179 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0)) (= .cse174 v_prenex_8) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse181 (select (select (let ((.cse186 (+ v_prenex_10 4))) (let ((.cse185 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse186 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse185 (select (select .cse185 |c_ULTIMATE.start_main_~root~0#1.base|) .cse186) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse181) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse182 (select (select (let ((.cse184 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse183 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse184 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse183 (select (select .cse183 |c_ULTIMATE.start_main_~root~0#1.base|) .cse184) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse181 .cse182) (= .cse182 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse182) (= .cse182 0) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|)))) (= .cse181 v_prenex_8)))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse187 (select (select (let ((.cse192 (+ v_prenex_10 4))) (let ((.cse191 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse192 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse191 (select (select .cse191 |c_ULTIMATE.start_main_~root~0#1.base|) .cse192) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse187) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse188 (select (select (let ((.cse190 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse189 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse190 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse189 (select (select .cse189 |c_ULTIMATE.start_main_~root~0#1.base|) .cse190) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse187 .cse188) (= .cse188 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse188) (= .cse188 0))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse193 (+ v_prenex_10 4))) (let ((.cse196 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse193 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse194 (select (select .cse196 |c_ULTIMATE.start_main_~root~0#1.base|) .cse193))) (let ((.cse195 (select (select (store .cse196 .cse194 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse193 0)) v_prenex_8 v_ArrVal_846) .cse194 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse195) (= .cse195 v_prenex_8) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))))))) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~root~0#1.base| (select (select (let ((.cse198 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse197 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse198 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse197 (select (select .cse197 |c_ULTIMATE.start_main_~root~0#1.base|) .cse198) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|)))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse199 (+ v_prenex_10 4))) (let ((.cse204 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse199 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse200 (select (select .cse204 |c_ULTIMATE.start_main_~root~0#1.base|) .cse199))) (let ((.cse201 (select (select (store .cse204 .cse200 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse199 0)) v_prenex_8 v_ArrVal_846) .cse200 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse201) (= .cse201 (select (select (let ((.cse203 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse202 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse203 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse202 (select (select .cse202 |c_ULTIMATE.start_main_~root~0#1.base|) .cse203) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (= .cse201 v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse205 (select (select (let ((.cse210 (+ v_prenex_10 4))) (let ((.cse209 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse210 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse209 (select (select .cse209 |c_ULTIMATE.start_main_~root~0#1.base|) .cse210) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (.cse206 (select (select (let ((.cse208 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse207 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse208 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse207 (select (select .cse207 |c_ULTIMATE.start_main_~root~0#1.base|) .cse208) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| .cse205) (= .cse205 .cse206) (= .cse206 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse206) (= .cse206 0) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|)))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse213 (select (select (let ((.cse215 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse214 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse215 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse214 (select (select .cse214 |c_ULTIMATE.start_main_~root~0#1.base|) .cse215) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select (select (let ((.cse212 (+ v_prenex_10 4))) (let ((.cse211 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse212 v_prenex_8)) v_prenex_8 v_prenex_7))) (store .cse211 (select (select .cse211 |c_ULTIMATE.start_main_~root~0#1.base|) .cse212) v_prenex_9))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) .cse213) (= .cse213 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse213) (= .cse213 0) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|)))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse216 (select (select (let ((.cse218 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse217 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse218 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse217 (select (select .cse217 |c_ULTIMATE.start_main_~root~0#1.base|) .cse218) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse216) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= .cse216 v_prenex_8)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse219 (+ v_prenex_10 4))) (let ((.cse222 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse219 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse220 (select (select .cse222 |c_ULTIMATE.start_main_~root~0#1.base|) .cse219))) (let ((.cse221 (select (select (store .cse222 .cse220 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse219 0)) v_prenex_8 v_ArrVal_846) .cse220 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse221) (= .cse221 v_prenex_8))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse224 (+ v_prenex_10 4))) (let ((.cse228 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse224 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse225 (select (select .cse228 |c_ULTIMATE.start_main_~root~0#1.base|) .cse224))) (let ((.cse223 (select (select (store .cse228 .cse225 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| .cse223) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse224 0)) v_prenex_8 v_ArrVal_846) .cse225 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0)) (= .cse223 v_prenex_8) (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (or (= .cse223 (select (select (let ((.cse227 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse226 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse227 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse226 (select (select .cse226 |c_ULTIMATE.start_main_~root~0#1.base|) .cse227) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|))))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse229 (+ v_prenex_10 4))) (let ((.cse235 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse229 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse230 (select (select .cse235 |c_ULTIMATE.start_main_~root~0#1.base|) .cse229))) (let ((.cse231 (select (select (store .cse235 .cse230 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)) (.cse232 (select (select (let ((.cse234 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse233 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse234 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse233 (select (select .cse233 |c_ULTIMATE.start_main_~root~0#1.base|) .cse234) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse229 0)) v_prenex_8 v_ArrVal_846) .cse230 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse231) (= .cse231 .cse232) (= .cse231 v_prenex_8) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= .cse232 v_prenex_8))))))) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int))) (let ((.cse236 (+ v_prenex_10 4))) (let ((.cse242 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse236 v_prenex_8)) v_prenex_8 v_prenex_7))) (let ((.cse237 (select (select .cse242 |c_ULTIMATE.start_main_~root~0#1.base|) .cse236))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse12 .cse236 0)) v_prenex_8 v_ArrVal_846) .cse237 v_ArrVal_848) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 0) (forall ((v_prenex_9 (Array Int Int))) (let ((.cse238 (select (select (store .cse242 .cse237 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (forall ((v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_10| Int) (v_ArrVal_847 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (let ((.cse239 (select (select (let ((.cse241 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse240 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse3 .cse241 |v_ULTIMATE.start_main_#t~malloc20#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_10| v_ArrVal_845))) (store .cse240 (select (select .cse240 |c_ULTIMATE.start_main_~root~0#1.base|) .cse241) v_ArrVal_847))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse238 .cse239) (= |v_ULTIMATE.start_main_#t~malloc20#1.base_10| |c_ULTIMATE.start_main_~root~0#1.base|) (= .cse239 v_prenex_8)))) (= |c_ULTIMATE.start_main_~root~0#1.base| .cse238) (= .cse238 v_prenex_8))))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_prenex_8)))))) is different from false