./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list_flag-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/list_flag-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:36:41,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:36:41,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:36:41,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:36:41,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:36:41,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:36:41,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:36:41,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:36:41,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:36:41,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:36:41,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:36:41,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:36:41,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:36:41,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:36:41,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:36:41,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:36:41,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:36:41,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:36:41,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:36:41,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:36:41,497 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:36:41,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:36:41,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:36:41,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:36:41,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:36:41,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:36:41,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:36:41,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:36:41,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:36:41,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:36:41,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:36:41,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:36:41,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:36:41,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:36:41,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:36:41,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:36:41,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:36:41,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:36:41,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:36:41,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:36:41,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:36:41,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:36:41,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:36:41,541 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:36:41,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:36:41,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:36:41,542 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:36:41,542 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:36:41,542 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:36:41,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:36:41,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:36:41,543 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:36:41,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:36:41,544 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:36:41,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:36:41,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:36:41,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:36:41,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:36:41,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:36:41,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:36:41,545 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:36:41,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:36:41,545 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:36:41,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:36:41,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:36:41,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:36:41,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:36:41,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:36:41,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:36:41,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:36:41,547 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:36:41,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:36:41,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:36:41,547 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:36:41,548 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:36:41,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:36:41,548 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da [2022-07-22 14:36:41,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:36:41,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:36:41,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:36:41,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:36:41,751 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:36:41,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-2.i [2022-07-22 14:36:41,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e18c6fb/4f677040364a470a8193f8a344148b46/FLAG7be010b0b [2022-07-22 14:36:42,162 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:36:42,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2022-07-22 14:36:42,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e18c6fb/4f677040364a470a8193f8a344148b46/FLAG7be010b0b [2022-07-22 14:36:42,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e18c6fb/4f677040364a470a8193f8a344148b46 [2022-07-22 14:36:42,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:36:42,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:36:42,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:36:42,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:36:42,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:36:42,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:36:42" (1/1) ... [2022-07-22 14:36:42,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6267e3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:36:42, skipping insertion in model container [2022-07-22 14:36:42,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:36:42" (1/1) ... [2022-07-22 14:36:42,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:36:42,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:36:42,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2022-07-22 14:36:42,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:36:42,850 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:36:42,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2022-07-22 14:36:42,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:36:42,905 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:36:42,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:36:42 WrapperNode [2022-07-22 14:36:42,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:36:42,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:36:42,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:36:42,908 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:36:42,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:36:42" (1/1) ... [2022-07-22 14:36:42,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:36:42" (1/1) ... [2022-07-22 14:36:42,947 INFO L137 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2022-07-22 14:36:42,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:36:42,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:36:42,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:36:42,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:36:42,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:36:42" (1/1) ... [2022-07-22 14:36:42,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:36:42" (1/1) ... [2022-07-22 14:36:42,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:36:42" (1/1) ... [2022-07-22 14:36:42,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:36:42" (1/1) ... [2022-07-22 14:36:42,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:36:42" (1/1) ... [2022-07-22 14:36:42,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:36:42" (1/1) ... [2022-07-22 14:36:42,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:36:42" (1/1) ... [2022-07-22 14:36:42,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:36:42,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:36:42,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:36:42,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:36:42,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:36:42" (1/1) ... [2022-07-22 14:36:42,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:36:42,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:36:42,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:36:42,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:36:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-22 14:36:43,023 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-22 14:36:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 14:36:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:36:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:36:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:36:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:36:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:36:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:36:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:36:43,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:36:43,081 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:36:43,082 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:36:43,107 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-22 14:36:43,184 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:36:43,188 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:36:43,198 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 14:36:43,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:36:43 BoogieIcfgContainer [2022-07-22 14:36:43,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:36:43,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:36:43,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:36:43,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:36:43,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:36:42" (1/3) ... [2022-07-22 14:36:43,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8a5cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:36:43, skipping insertion in model container [2022-07-22 14:36:43,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:36:42" (2/3) ... [2022-07-22 14:36:43,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8a5cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:36:43, skipping insertion in model container [2022-07-22 14:36:43,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:36:43" (3/3) ... [2022-07-22 14:36:43,215 INFO L111 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2022-07-22 14:36:43,224 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:36:43,239 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:36:43,283 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:36:43,287 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d479761, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@654c8044 [2022-07-22 14:36:43,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:36:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 14:36:43,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:43,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:43,296 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:43,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash 943582971, now seen corresponding path program 1 times [2022-07-22 14:36:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:43,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049771199] [2022-07-22 14:36:43,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:43,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:43,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049771199] [2022-07-22 14:36:43,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049771199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:36:43,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:36:43,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:36:43,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16973475] [2022-07-22 14:36:43,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:36:43,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:36:43,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:36:43,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:36:43,517 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:43,536 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-07-22 14:36:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:36:43,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-07-22 14:36:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:43,542 INFO L225 Difference]: With dead ends: 40 [2022-07-22 14:36:43,542 INFO L226 Difference]: Without dead ends: 20 [2022-07-22 14:36:43,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:36:43,549 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:43,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:36:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-22 14:36:43,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 14:36:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-22 14:36:43,571 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2022-07-22 14:36:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:43,571 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-22 14:36:43,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-22 14:36:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 14:36:43,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:43,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:43,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:36:43,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash 267820561, now seen corresponding path program 1 times [2022-07-22 14:36:43,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:43,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605421691] [2022-07-22 14:36:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:43,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:43,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:43,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605421691] [2022-07-22 14:36:43,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605421691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:36:43,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:36:43,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:36:43,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600605767] [2022-07-22 14:36:43,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:36:43,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:36:43,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:43,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:36:43,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:36:43,672 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:43,740 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-07-22 14:36:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:36:43,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-07-22 14:36:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:43,742 INFO L225 Difference]: With dead ends: 44 [2022-07-22 14:36:43,742 INFO L226 Difference]: Without dead ends: 40 [2022-07-22 14:36:43,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:36:43,745 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:43,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 57 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:36:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-22 14:36:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-07-22 14:36:43,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-22 14:36:43,755 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 13 [2022-07-22 14:36:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:43,756 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-22 14:36:43,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-22 14:36:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 14:36:43,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:43,761 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:43,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:36:43,762 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash -273802420, now seen corresponding path program 1 times [2022-07-22 14:36:43,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:43,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220769260] [2022-07-22 14:36:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:43,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:43,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:43,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220769260] [2022-07-22 14:36:43,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220769260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:36:43,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:36:43,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:36:43,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914825698] [2022-07-22 14:36:43,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:36:43,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:36:43,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:43,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:36:43,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:36:43,835 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:43,908 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-07-22 14:36:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:36:43,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-22 14:36:43,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:43,909 INFO L225 Difference]: With dead ends: 46 [2022-07-22 14:36:43,909 INFO L226 Difference]: Without dead ends: 38 [2022-07-22 14:36:43,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:36:43,910 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:43,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 61 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:36:43,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-22 14:36:43,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-07-22 14:36:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-07-22 14:36:43,913 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2022-07-22 14:36:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:43,913 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-07-22 14:36:43,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-07-22 14:36:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 14:36:43,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:43,914 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:43,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 14:36:43,914 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:43,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1517543941, now seen corresponding path program 1 times [2022-07-22 14:36:43,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:43,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014994434] [2022-07-22 14:36:43,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:43,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:43,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:43,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014994434] [2022-07-22 14:36:43,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014994434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:36:43,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:36:43,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:36:43,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674861872] [2022-07-22 14:36:43,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:36:43,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:36:43,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:43,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:36:43,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:36:43,953 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:43,994 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-07-22 14:36:43,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:36:43,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-22 14:36:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:43,996 INFO L225 Difference]: With dead ends: 50 [2022-07-22 14:36:43,996 INFO L226 Difference]: Without dead ends: 40 [2022-07-22 14:36:43,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:36:43,997 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:43,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 56 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:36:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-22 14:36:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2022-07-22 14:36:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-22 14:36:44,000 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-07-22 14:36:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:44,000 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-22 14:36:44,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-22 14:36:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 14:36:44,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:44,001 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:44,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 14:36:44,001 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:44,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:44,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1906655974, now seen corresponding path program 1 times [2022-07-22 14:36:44,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:44,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919294302] [2022-07-22 14:36:44,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:44,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:44,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:44,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919294302] [2022-07-22 14:36:44,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919294302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:36:44,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:36:44,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:36:44,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539651609] [2022-07-22 14:36:44,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:36:44,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:36:44,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:44,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:36:44,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:36:44,045 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) [2022-07-22 14:36:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:44,054 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-07-22 14:36:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:36:44,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 [2022-07-22 14:36:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:44,054 INFO L225 Difference]: With dead ends: 50 [2022-07-22 14:36:44,055 INFO L226 Difference]: Without dead ends: 34 [2022-07-22 14:36:44,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:36:44,062 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:44,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:36:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-22 14:36:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-07-22 14:36:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-22 14:36:44,067 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2022-07-22 14:36:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:44,067 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-22 14:36:44,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) [2022-07-22 14:36:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-22 14:36:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 14:36:44,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:44,070 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:44,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 14:36:44,071 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1462919029, now seen corresponding path program 1 times [2022-07-22 14:36:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:44,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898790779] [2022-07-22 14:36:44,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:44,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:44,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:44,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898790779] [2022-07-22 14:36:44,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898790779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:44,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748622306] [2022-07-22 14:36:44,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:44,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:44,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:36:44,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:36:44,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 14:36:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:44,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-22 14:36:44,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:36:44,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:36:44,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:36:44,353 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:36:44,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:36:44,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:44,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-22 14:36:44,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:36:44,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:36:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:44,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:36:44,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_106 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-22 14:36:44,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_104 Int) (v_ArrVal_106 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_104)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-22 14:36:44,515 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-22 14:36:44,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-22 14:36:44,522 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:44,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-22 14:36:44,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-22 14:36:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 14:36:44,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748622306] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:36:44,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:36:44,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-07-22 14:36:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998311982] [2022-07-22 14:36:44,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:36:44,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 14:36:44,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:44,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 14:36:44,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=240, Unknown=2, NotChecked=66, Total=380 [2022-07-22 14:36:44,599 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:44,714 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-07-22 14:36:44,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 14:36:44,715 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 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 [2022-07-22 14:36:44,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:44,715 INFO L225 Difference]: With dead ends: 50 [2022-07-22 14:36:44,715 INFO L226 Difference]: Without dead ends: 46 [2022-07-22 14:36:44,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=329, Unknown=2, NotChecked=78, Total=506 [2022-07-22 14:36:44,716 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:44,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 133 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 83 Unchecked, 0.1s Time] [2022-07-22 14:36:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-22 14:36:44,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2022-07-22 14:36:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-07-22 14:36:44,719 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 19 [2022-07-22 14:36:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:44,720 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-07-22 14:36:44,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-07-22 14:36:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 14:36:44,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:44,720 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:44,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 14:36:44,941 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,SelfDestructingSolverStorable5 [2022-07-22 14:36:44,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:44,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1319849960, now seen corresponding path program 1 times [2022-07-22 14:36:44,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:44,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014444816] [2022-07-22 14:36:44,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:44,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:45,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:45,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014444816] [2022-07-22 14:36:45,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014444816] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:45,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798935304] [2022-07-22 14:36:45,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:45,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:45,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:36:45,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:36:45,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 14:36:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:45,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-22 14:36:45,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:36:45,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:36:45,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:36:45,155 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:36:45,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:36:45,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:45,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-22 14:36:45,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:36:45,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:36:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:45,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:36:45,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-07-22 14:36:45,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_155 Int) (v_ArrVal_158 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_155)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-22 14:36:45,285 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-22 14:36:45,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-22 14:36:45,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:45,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-22 14:36:45,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-22 14:36:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 14:36:45,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798935304] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:36:45,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:36:45,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-07-22 14:36:45,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313008444] [2022-07-22 14:36:45,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:36:45,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 14:36:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:45,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 14:36:45,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=240, Unknown=3, NotChecked=66, Total=380 [2022-07-22 14:36:45,383 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:49,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:49,550 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2022-07-22 14:36:49,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 14:36:49,551 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 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 [2022-07-22 14:36:49,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:49,552 INFO L225 Difference]: With dead ends: 85 [2022-07-22 14:36:49,552 INFO L226 Difference]: Without dead ends: 81 [2022-07-22 14:36:49,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=108, Invalid=317, Unknown=3, NotChecked=78, Total=506 [2022-07-22 14:36:49,553 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 78 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:49,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 191 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 161 Invalid, 0 Unknown, 108 Unchecked, 0.1s Time] [2022-07-22 14:36:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-22 14:36:49,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 49. [2022-07-22 14:36:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-07-22 14:36:49,557 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 19 [2022-07-22 14:36:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:49,557 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-07-22 14:36:49,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-07-22 14:36:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 14:36:49,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:49,558 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:49,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:36:49,767 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,SelfDestructingSolverStorable6 [2022-07-22 14:36:49,768 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:49,769 INFO L85 PathProgramCache]: Analyzing trace with hash 876113015, now seen corresponding path program 1 times [2022-07-22 14:36:49,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:49,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18459272] [2022-07-22 14:36:49,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:49,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:49,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:49,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18459272] [2022-07-22 14:36:49,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18459272] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:36:49,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:36:49,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:36:49,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82557372] [2022-07-22 14:36:49,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:36:49,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:36:49,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:49,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:36:49,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:36:49,792 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) [2022-07-22 14:36:49,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:49,798 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-07-22 14:36:49,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:36:49,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 [2022-07-22 14:36:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:49,799 INFO L225 Difference]: With dead ends: 67 [2022-07-22 14:36:49,799 INFO L226 Difference]: Without dead ends: 53 [2022-07-22 14:36:49,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:36:49,800 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:49,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:36:49,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-22 14:36:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2022-07-22 14:36:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-07-22 14:36:49,803 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 19 [2022-07-22 14:36:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:49,804 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-07-22 14:36:49,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) [2022-07-22 14:36:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-07-22 14:36:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 14:36:49,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:49,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:49,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 14:36:49,805 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:49,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:49,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1445257616, now seen corresponding path program 1 times [2022-07-22 14:36:49,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:49,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461586624] [2022-07-22 14:36:49,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:49,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:49,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461586624] [2022-07-22 14:36:49,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461586624] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:49,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147082776] [2022-07-22 14:36:49,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:49,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:49,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:36:49,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:36:49,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 14:36:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:49,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 14:36:49,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:36:49,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:36:50,004 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:36:50,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:36:50,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:36:50,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:36:50,058 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:36:50,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-07-22 14:36:50,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-07-22 14:36:50,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-07-22 14:36:50,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-22 14:36:50,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-22 14:36:50,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:36:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:50,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:36:50,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2022-07-22 14:36:50,127 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_231 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-22 14:36:50,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:50,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-22 14:36:50,144 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:50,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2022-07-22 14:36:50,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:36:50,158 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:36:50,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-22 14:36:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 14:36:50,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147082776] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:36:50,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:36:50,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-22 14:36:50,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308963403] [2022-07-22 14:36:50,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:36:50,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 14:36:50,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:50,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 14:36:50,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2022-07-22 14:36:50,241 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:50,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:50,434 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-07-22 14:36:50,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 14:36:50,435 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 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 [2022-07-22 14:36:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:50,436 INFO L225 Difference]: With dead ends: 65 [2022-07-22 14:36:50,436 INFO L226 Difference]: Without dead ends: 61 [2022-07-22 14:36:50,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=381, Unknown=1, NotChecked=40, Total=506 [2022-07-22 14:36:50,436 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 49 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:50,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 135 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 204 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2022-07-22 14:36:50,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-22 14:36:50,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-07-22 14:36:50,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-07-22 14:36:50,440 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 21 [2022-07-22 14:36:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:50,440 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-07-22 14:36:50,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-07-22 14:36:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 14:36:50,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:50,441 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:50,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:36:50,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:50,642 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:50,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:50,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1652508907, now seen corresponding path program 2 times [2022-07-22 14:36:50,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:50,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325977916] [2022-07-22 14:36:50,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:50,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:50,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:50,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325977916] [2022-07-22 14:36:50,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325977916] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:50,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912495663] [2022-07-22 14:36:50,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:36:50,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:50,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:36:50,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:36:50,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 14:36:50,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:36:50,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:36:50,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-22 14:36:50,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:36:50,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:36:50,854 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:36:50,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:36:50,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:36:50,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:36:50,912 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:36:50,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-07-22 14:36:50,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-07-22 14:36:50,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-07-22 14:36:50,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-22 14:36:50,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-22 14:36:50,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:36:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:50,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:36:51,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 30 [2022-07-22 14:36:51,015 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-22 14:36:51,027 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:51,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-22 14:36:51,033 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:51,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2022-07-22 14:36:51,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:36:51,049 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:36:51,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-22 14:36:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 14:36:51,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912495663] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:36:51,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:36:51,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-07-22 14:36:51,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927083801] [2022-07-22 14:36:51,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:36:51,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 14:36:51,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:51,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 14:36:51,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2022-07-22 14:36:51,124 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:51,443 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-07-22 14:36:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 14:36:51,444 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 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 23 [2022-07-22 14:36:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:51,444 INFO L225 Difference]: With dead ends: 67 [2022-07-22 14:36:51,444 INFO L226 Difference]: Without dead ends: 55 [2022-07-22 14:36:51,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=783, Unknown=1, NotChecked=58, Total=992 [2022-07-22 14:36:51,445 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:51,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 317 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2022-07-22 14:36:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-22 14:36:51,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-07-22 14:36:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-07-22 14:36:51,449 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 23 [2022-07-22 14:36:51,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:51,449 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-07-22 14:36:51,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-07-22 14:36:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 14:36:51,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:51,450 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:51,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-22 14:36:51,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:51,660 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1313154078, now seen corresponding path program 1 times [2022-07-22 14:36:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:51,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241141896] [2022-07-22 14:36:51,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:51,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:51,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:51,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241141896] [2022-07-22 14:36:51,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241141896] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:51,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270109423] [2022-07-22 14:36:51,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:51,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:51,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:36:51,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:36:51,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 14:36:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:51,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-22 14:36:51,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:36:51,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:36:51,877 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:36:51,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:36:51,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:36:51,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:36:51,930 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:36:51,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-07-22 14:36:51,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-07-22 14:36:51,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-22 14:36:51,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-22 14:36:51,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-22 14:36:51,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:36:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:51,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:36:52,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 30 [2022-07-22 14:36:52,019 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_338 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2022-07-22 14:36:52,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:52,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-22 14:36:52,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:52,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2022-07-22 14:36:52,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:36:52,058 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:36:52,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-22 14:36:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 14:36:52,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270109423] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:36:52,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:36:52,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-07-22 14:36:52,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425225393] [2022-07-22 14:36:52,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:36:52,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 14:36:52,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:52,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 14:36:52,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2022-07-22 14:36:52,124 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:52,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:52,370 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-07-22 14:36:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 14:36:52,370 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 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 23 [2022-07-22 14:36:52,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:52,371 INFO L225 Difference]: With dead ends: 61 [2022-07-22 14:36:52,371 INFO L226 Difference]: Without dead ends: 49 [2022-07-22 14:36:52,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=783, Unknown=1, NotChecked=58, Total=992 [2022-07-22 14:36:52,372 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:52,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 191 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 206 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-07-22 14:36:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-22 14:36:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2022-07-22 14:36:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-07-22 14:36:52,376 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 23 [2022-07-22 14:36:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:52,376 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-07-22 14:36:52,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-07-22 14:36:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-22 14:36:52,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:52,377 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:52,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 14:36:52,598 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,SelfDestructingSolverStorable10 [2022-07-22 14:36:52,598 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:52,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:52,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1075490678, now seen corresponding path program 2 times [2022-07-22 14:36:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:52,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309684705] [2022-07-22 14:36:52,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:52,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:52,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:52,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309684705] [2022-07-22 14:36:52,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309684705] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:52,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197503032] [2022-07-22 14:36:52,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:36:52,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:52,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:36:52,720 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:36:52,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 14:36:52,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:36:52,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:36:52,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-22 14:36:52,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:36:52,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:36:52,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:36:52,865 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:36:52,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:36:52,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:52,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-22 14:36:52,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:36:52,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:36:52,966 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-22 14:36:52,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-22 14:36:53,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:36:53,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:53,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:36:55,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-07-22 14:36:55,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) is different from false [2022-07-22 14:36:55,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) is different from false [2022-07-22 14:36:55,160 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_415 Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_415)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-07-22 14:36:55,238 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-22 14:36:55,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-07-22 14:36:55,250 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:55,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 273 [2022-07-22 14:36:55,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 241 [2022-07-22 14:36:55,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:36:55,305 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:55,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 141 [2022-07-22 14:36:55,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 125 [2022-07-22 14:36:55,853 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:55,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 294 [2022-07-22 14:36:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-22 14:36:56,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197503032] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:36:56,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:36:56,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2022-07-22 14:36:56,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143401204] [2022-07-22 14:36:56,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:36:56,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-22 14:36:56,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:56,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-22 14:36:56,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=645, Unknown=5, NotChecked=220, Total=992 [2022-07-22 14:36:56,045 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:56,131 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-22 14:36:56,136 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-22 14:36:56,139 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-22 14:36:58,141 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) is different from false [2022-07-22 14:36:58,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:58,196 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-07-22 14:36:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 14:36:58,197 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 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 [2022-07-22 14:36:58,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:58,197 INFO L225 Difference]: With dead ends: 55 [2022-07-22 14:36:58,197 INFO L226 Difference]: Without dead ends: 51 [2022-07-22 14:36:58,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=160, Invalid=793, Unknown=9, NotChecked=520, Total=1482 [2022-07-22 14:36:58,198 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:58,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 201 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 156 Invalid, 0 Unknown, 133 Unchecked, 0.1s Time] [2022-07-22 14:36:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-22 14:36:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-22 14:36:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-07-22 14:36:58,201 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 25 [2022-07-22 14:36:58,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:58,201 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-07-22 14:36:58,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:36:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-07-22 14:36:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-22 14:36:58,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:58,202 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:58,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 14:36:58,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:58,404 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1387463807, now seen corresponding path program 2 times [2022-07-22 14:36:58,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:58,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822500877] [2022-07-22 14:36:58,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:58,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:58,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:58,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822500877] [2022-07-22 14:36:58,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822500877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:58,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017251363] [2022-07-22 14:36:58,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:36:58,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:58,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:36:58,529 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:36:58,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 14:36:58,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:36:58,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:36:58,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-22 14:36:58,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:36:58,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:36:58,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:36:58,699 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:36:58,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:36:58,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:58,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-22 14:36:58,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:36:58,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:36:58,814 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-22 14:36:58,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-22 14:36:58,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:36:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:36:58,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:36:59,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) is different from false [2022-07-22 14:36:59,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-07-22 14:36:59,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) is different from false [2022-07-22 14:36:59,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_500)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) is different from false [2022-07-22 14:36:59,925 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-22 14:36:59,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-07-22 14:36:59,938 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:59,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 273 [2022-07-22 14:36:59,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 241 [2022-07-22 14:36:59,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:36:59,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 125 [2022-07-22 14:37:00,068 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:00,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 137 [2022-07-22 14:37:00,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:00,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 349 treesize of output 329 [2022-07-22 14:37:00,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-22 14:37:00,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017251363] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:37:00,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:37:00,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2022-07-22 14:37:00,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506275265] [2022-07-22 14:37:00,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:37:00,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-22 14:37:00,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:00,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-22 14:37:00,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=645, Unknown=5, NotChecked=220, Total=992 [2022-07-22 14:37:00,779 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:00,856 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-22 14:37:00,858 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-22 14:37:00,863 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 2)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-22 14:37:01,911 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-22 14:37:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:01,979 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-07-22 14:37:01,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 14:37:01,979 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 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 [2022-07-22 14:37:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:01,980 INFO L225 Difference]: With dead ends: 75 [2022-07-22 14:37:01,980 INFO L226 Difference]: Without dead ends: 71 [2022-07-22 14:37:01,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=160, Invalid=793, Unknown=9, NotChecked=520, Total=1482 [2022-07-22 14:37:01,981 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 65 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:37:01,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 211 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 195 Invalid, 0 Unknown, 173 Unchecked, 0.1s Time] [2022-07-22 14:37:01,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-22 14:37:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2022-07-22 14:37:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-07-22 14:37:01,987 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 25 [2022-07-22 14:37:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:01,987 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-07-22 14:37:01,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-07-22 14:37:01,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:37:01,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:01,988 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:02,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-22 14:37:02,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:37:02,200 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:02,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:02,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1574953317, now seen corresponding path program 3 times [2022-07-22 14:37:02,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:02,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042393286] [2022-07-22 14:37:02,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:02,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:02,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:02,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042393286] [2022-07-22 14:37:02,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042393286] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:37:02,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411617007] [2022-07-22 14:37:02,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 14:37:02,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:37:02,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:37:02,455 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:37:02,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 14:37:02,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 14:37:02,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:37:02,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-22 14:37:02,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:37:02,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:37:02,563 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:37:02,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:37:02,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:37:02,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:37:02,641 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:37:02,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-22 14:37:02,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:37:02,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-22 14:37:02,725 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:37:02,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2022-07-22 14:37:02,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-07-22 14:37:02,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-07-22 14:37:02,795 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:37:02,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2022-07-22 14:37:02,847 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-22 14:37:02,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 70 [2022-07-22 14:37:02,859 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-22 14:37:02,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-07-22 14:37:02,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-22 14:37:02,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 57 [2022-07-22 14:37:02,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2022-07-22 14:37:02,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2022-07-22 14:37:03,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 93 [2022-07-22 14:37:03,158 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-07-22 14:37:03,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 81 [2022-07-22 14:37:03,337 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:37:03,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-07-22 14:37:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:03,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:37:05,476 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (or (= .cse0 1) (= .cse0 3)))) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2022-07-22 14:37:05,505 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_592)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_77| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_77|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= 3 .cse0) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= .cse0 1)))))) is different from false [2022-07-22 14:37:05,528 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_592)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_77| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_77|) 0 3))))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 0)) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= .cse0 3) (= .cse0 1) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))) is different from false [2022-07-22 14:37:05,545 INFO L356 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-07-22 14:37:05,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3943 treesize of output 3711 [2022-07-22 14:37:05,584 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:05,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2122 treesize of output 1860 [2022-07-22 14:37:07,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:37:07,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:37:07,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:37:07,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:37:07,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:37:07,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:37:07,920 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (or (not .cse0) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse1)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (or (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse2 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse3))))) .cse4)) (not .cse5)) (or (and .cse0 .cse5) (let ((.cse6 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse51 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse7 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse50 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse13 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse49 0))))))))) (.cse14 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse48 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse48)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse15 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse16 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse46 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse46 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse17 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse45 0))))))) (.cse18 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse44 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse44))))) (.cse19 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse43 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse43)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse20 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse42 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))))))) (.cse8 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse41 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse41 0))))))))) (.cse9 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse40 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse40)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (.cse10 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse39)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (.cse11 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse38))))) (.cse12 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (.cse35 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse36 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse36 0)))))))))) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse4 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or (and (= |c_ULTIMATE.start_main_~a~0#1.offset| (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) .cse5) (and .cse6 .cse7 (or .cse4 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse21)))) (forall ((v_ArrVal_598 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) .cse13 .cse14 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse22)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse23 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse23 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse24 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse25 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse25)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) .cse15 .cse16 .cse17 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse26)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse27 0)))))))) .cse18 .cse19 .cse20)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse28)))) (forall ((v_ArrVal_598 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse8 .cse9 .cse10 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse29 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse30 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse30)))))))) .cse11 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse31)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse32 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse33)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse34 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse34 0)))))))) .cse12 .cse35)) .cse35))))) is different from false [2022-07-22 14:37:09,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:09,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-22 14:37:09,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:09,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-22 14:37:09,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:09,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:09,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-07-22 14:37:09,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:09,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:09,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-07-22 14:37:09,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:09,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-22 14:37:09,742 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:09,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-07-22 14:37:09,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:09,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:09,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-07-22 14:37:09,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:37:09,764 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:09,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-07-22 14:37:09,769 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:09,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-22 14:37:09,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:09,779 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:09,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 58 [2022-07-22 14:37:09,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:09,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:09,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2022-07-22 14:37:09,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:09,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2022-07-22 14:37:09,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:37:09,822 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:09,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-07-22 14:37:09,827 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:09,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-22 14:37:09,836 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:09,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-22 14:37:09,840 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:09,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-07-22 14:37:09,845 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:09,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-22 14:37:09,851 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:09,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2022-07-22 14:37:09,856 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:09,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2022-07-22 14:37:09,860 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 14:37:09,862 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 14:37:09,865 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 14:37:09,869 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:09,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-07-22 14:37:09,882 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:09,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-07-22 14:37:09,887 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:09,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-22 14:37:09,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:09,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:09,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2022-07-22 14:37:09,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-22 14:37:09,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:37:09,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:37:09,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:37:09,914 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 14:37:09,919 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:09,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-22 14:37:09,924 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:09,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-22 14:37:09,928 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 14:37:09,931 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 14:37:09,960 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:09,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-07-22 14:37:09,965 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 14:37:09,973 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:09,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-22 14:37:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-22 14:37:10,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411617007] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:37:10,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:37:10,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2022-07-22 14:37:10,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773307543] [2022-07-22 14:37:10,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:37:10,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-22 14:37:10,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:10,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-22 14:37:10,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=891, Unknown=4, NotChecked=252, Total=1260 [2022-07-22 14:37:10,143 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:10,360 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse53 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse5 (not .cse6)) (.cse4 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse54 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (or (not .cse0) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse1)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (or (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse2 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse3))))) .cse4)) .cse5) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (or (and .cse0 .cse6) (let ((.cse7 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse52 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse52 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse8 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse51 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse14 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse50 0))))))))) (.cse15 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse49 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse49)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse16 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse17 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse47 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse47 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse18 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse46 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse46 0))))))) (.cse19 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse45))))) (.cse20 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse44 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse44)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse21 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))))))) (.cse9 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse42 0))))))))) (.cse10 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse41 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse41)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (.cse11 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse40 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse40)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (.cse12 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse39))))) (.cse13 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (.cse36 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse37 0)))))))))) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (or .cse4 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (or (and (= |c_ULTIMATE.start_main_~a~0#1.offset| (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) .cse6) (and .cse7 .cse8 (or .cse4 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse22)))) (forall ((v_ArrVal_598 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) .cse14 .cse15 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse23)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse24 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse25 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse26)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) .cse16 .cse17 .cse18 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse27)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse28 0)))))))) .cse19 .cse20 .cse21)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse29)))) (forall ((v_ArrVal_598 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 .cse10 .cse11 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse31)))))))) .cse12 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse32)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse33 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse34)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse35 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse35 0)))))))) .cse13 .cse36)) .cse36))) (not (= .cse53 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse54 0) (= .cse53 |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 .cse4 (= .cse54 |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2022-07-22 14:37:10,417 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse53 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse5 (not .cse6)) (.cse4 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse54 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (or (not .cse0) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse1)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (or (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse2 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse3))))) .cse4)) .cse5) (or (and .cse0 .cse6) (let ((.cse7 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse52 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse52 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse8 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse51 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse14 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse50 0))))))))) (.cse15 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse49 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse49)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse16 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse17 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse47 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse47 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse18 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse46 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse46 0))))))) (.cse19 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse45))))) (.cse20 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse44 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse44)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (.cse21 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))))))) (.cse9 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse42 0))))))))) (.cse10 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse41 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse41)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (.cse11 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse40 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse40)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (.cse12 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse39))))) (.cse13 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (.cse36 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse37 0)))))))))) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (or .cse4 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (or (and (= |c_ULTIMATE.start_main_~a~0#1.offset| (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) .cse6) (and .cse7 .cse8 (or .cse4 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse22)))) (forall ((v_ArrVal_598 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) .cse14 .cse15 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse23)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse24 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse25 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse26)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) .cse16 .cse17 .cse18 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse27)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse28 0)))))))) .cse19 .cse20 .cse21)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse29)))) (forall ((v_ArrVal_598 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 .cse10 .cse11 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse31)))))))) .cse12 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse32)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse33 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse34)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse35 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse35 0)))))))) .cse13 .cse36)) .cse36))) (not (= .cse53 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse54 0) (= .cse53 |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 .cse4 (= .cse54 |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2022-07-22 14:37:10,431 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse3 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 v_ArrVal_592)))) (store .cse6 |v_ULTIMATE.start_main_~p~0#1.base_77| (store (select .cse6 |v_ULTIMATE.start_main_~p~0#1.base_77|) 0 3))))) (let ((.cse2 (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 0)) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= .cse2 3) (= .cse2 1) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))))) is different from false [2022-07-22 14:37:10,437 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse3 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 v_ArrVal_592)))) (store .cse6 |v_ULTIMATE.start_main_~p~0#1.base_77| (store (select .cse6 |v_ULTIMATE.start_main_~p~0#1.base_77|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse2 (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= 3 .cse2) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= .cse2 1)))))))) is different from false [2022-07-22 14:37:12,443 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_int| .cse1) .cse6) 1)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) (+ .cse6 4)))) (and (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0) (and (not (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse0) .cse2))) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse3 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse4 (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) (or (= .cse4 1) (= .cse4 3)))) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= .cse6 0) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse3)))) is different from false [2022-07-22 14:37:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:13,036 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-07-22 14:37:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 14:37:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 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 27 [2022-07-22 14:37:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:13,037 INFO L225 Difference]: With dead ends: 67 [2022-07-22 14:37:13,037 INFO L226 Difference]: Without dead ends: 63 [2022-07-22 14:37:13,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=193, Invalid=1394, Unknown=9, NotChecked=756, Total=2352 [2022-07-22 14:37:13,038 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:37:13,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 198 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 201 Invalid, 0 Unknown, 147 Unchecked, 0.1s Time] [2022-07-22 14:37:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-22 14:37:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-22 14:37:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-07-22 14:37:13,045 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 27 [2022-07-22 14:37:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:13,045 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-07-22 14:37:13,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-07-22 14:37:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:37:13,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:13,046 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:13,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 14:37:13,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 14:37:13,260 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:13,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:13,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1961532986, now seen corresponding path program 2 times [2022-07-22 14:37:13,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:13,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608109032] [2022-07-22 14:37:13,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:13,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:13,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608109032] [2022-07-22 14:37:13,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608109032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:37:13,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563040648] [2022-07-22 14:37:13,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:37:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:37:13,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:37:13,484 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:37:13,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 14:37:13,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:37:13,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:37:13,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-22 14:37:13,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:37:13,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:37:13,596 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:37:13,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:37:13,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:37:13,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:37:13,681 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:37:13,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-22 14:37:13,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:37:13,698 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:37:13,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-22 14:37:13,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:37:13,784 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:37:13,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2022-07-22 14:37:13,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:13,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-07-22 14:37:13,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-07-22 14:37:13,847 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:37:13,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2022-07-22 14:37:13,858 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-22 14:37:13,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-07-22 14:37:13,875 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-22 14:37:13,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 47 [2022-07-22 14:37:13,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-22 14:37:13,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2022-07-22 14:37:14,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 77 [2022-07-22 14:37:14,139 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-22 14:37:14,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 76 [2022-07-22 14:37:14,321 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:37:14,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-07-22 14:37:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:14,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:37:16,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (not (= 2 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (or (= 2 .cse0) (= 3 .cse0)))))) is different from false [2022-07-22 14:37:16,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_682)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_87|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (= .cse1 3) (= .cse1 2)))))) is different from false [2022-07-22 14:37:16,520 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_682)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_87|) 0 3))))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 0)) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (not (= 2 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= 3 .cse1) (= 2 .cse1)))))) is different from false [2022-07-22 14:37:16,537 INFO L356 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-07-22 14:37:16,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1842 treesize of output 1780 [2022-07-22 14:37:16,566 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:16,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 823 treesize of output 726 [2022-07-22 14:37:17,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:37:19,809 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~a~0#1.offset| (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse70 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_31 .cse70) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse70))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse71 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse71 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse71))))))) (.cse10 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse69 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse69 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse69 0))))))) (.cse12 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse68 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse68 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse68 0)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse67 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse67 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse67)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))))) (.cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse66 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse66 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) (.cse25 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse0 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse1 .cse2) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse3 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse3 0)))) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (or .cse4 (and .cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_31 .cse6) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse6))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse7 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse7)))))) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse9 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= .cse8 0)))) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) .cse10 (forall ((v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (= .cse11 0)))))) .cse12 .cse13 .cse14)) (or (let ((.cse20 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse50 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse50)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))))) (.cse21 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse48 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_31 .cse48) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse48))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse49 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse49))))))) (.cse22 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) (.cse23 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse46 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse46 0))))))) (.cse24 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse45 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse45 0)))))))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse16 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= .cse15 .cse16) (= .cse15 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse16) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse17)))))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse18 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= (select v_arrayElimArr_31 .cse18) 0)) (not (= .cse19 .cse18)) (= .cse19 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse20 .cse21 .cse22 .cse23 .cse24) .cse25) (or .cse4 (and .cse20 .cse21 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse26 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_31 .cse26) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse26))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse27)))))) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse28 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= .cse28 0)))))) .cse22 .cse23 (forall ((v_arrayElimArr_31 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) (not (= .cse30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (= .cse30 0)))) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) .cse24)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse31 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse31 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse33) (= .cse33 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse35 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse34 .cse35) (= .cse34 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse35) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse36) (= .cse36 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_arrayElimArr_31 (Array Int Int))) (or (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse37 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse37 0)))) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse39 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse38 .cse39) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse39) 0)) (= .cse38 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse41) (= .cse41 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse42 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse44 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse44 0)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse52 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse51 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse51 .cse52) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse52) 0)) (= .cse51 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse53 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse53 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse53 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse54) (= .cse54 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse55 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse55 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse55 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or (and .cse5 .cse10 .cse12 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse56 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse57 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= (select v_arrayElimArr_31 .cse56) 0)) (not (= .cse57 .cse56)) (= .cse57 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) .cse13 .cse14) .cse25) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse58 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse59 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= .cse58 .cse59) (= .cse58 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse59) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse60 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse60 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse60)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse61 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse61 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse61) (= .cse61 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse62 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse62 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse62 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse63 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse63 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse63 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse64 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse64 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse65 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse65) (= .cse65 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) is different from false [2022-07-22 14:37:21,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:21,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2022-07-22 14:37:21,457 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:21,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-22 14:37:21,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:21,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:21,467 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-22 14:37:21,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 21 [2022-07-22 14:37:21,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:21,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:21,476 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-22 14:37:21,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 9 [2022-07-22 14:37:21,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:37:21,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:21,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2022-07-22 14:37:21,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:21,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:21,497 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-22 14:37:21,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 21 [2022-07-22 14:37:21,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:37:21,506 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-22 14:37:21,518 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2022-07-22 14:37:21,523 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-22 14:37:21,536 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-22 14:37:21,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:21,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-07-22 14:37:21,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:21,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-07-22 14:37:21,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:21,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:21,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-07-22 14:37:21,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:21,560 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:21,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 58 [2022-07-22 14:37:21,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-22 14:37:21,570 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:21,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-07-22 14:37:21,599 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-22 14:37:21,606 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-07-22 14:37:21,612 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-22 14:37:21,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:21,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-07-22 14:37:21,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:21,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-22 14:37:21,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:21,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:21,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:21,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2022-07-22 14:37:21,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-22 14:37:21,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:37:21,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:37:21,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:37:21,656 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-22 14:37:21,665 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-07-22 14:37:21,670 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 1 [2022-07-22 14:37:21,678 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2022-07-22 14:37:21,685 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2022-07-22 14:37:21,690 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-07-22 14:37:21,697 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-22 14:37:21,704 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2022-07-22 14:37:21,709 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-22 14:37:21,717 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2022-07-22 14:37:21,723 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-22 14:37:21,729 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-22 14:37:21,735 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:21,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-07-22 14:37:21,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:21,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2022-07-22 14:37:21,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:21,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:21,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 77 [2022-07-22 14:37:21,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-07-22 14:37:21,765 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 14:37:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-22 14:37:21,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563040648] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:37:21,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:37:21,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2022-07-22 14:37:21,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149032865] [2022-07-22 14:37:21,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:37:21,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-22 14:37:21,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:21,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-22 14:37:21,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=890, Unknown=4, NotChecked=252, Total=1260 [2022-07-22 14:37:21,956 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:23,110 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse5 (= |c_ULTIMATE.start_main_~a~0#1.offset| (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse6 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse73 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_31 .cse73) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse73))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse74 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse74 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse74))))))) (.cse11 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse72 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse72 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse72 0))))))) (.cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse71 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse71 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse71 0)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse70 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse70 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse70)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))))) (.cse15 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse69 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse69 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) (.cse27 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse53 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse16 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse0 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse1 .cse2) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse3 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse3 0)))) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (not (= .cse4 |c_ULTIMATE.start_main_~a~0#1.base|)) (or .cse5 (and .cse6 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_31 .cse7) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse7))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse8 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse8)))))) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse9 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse10 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= .cse9 0)))) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) .cse11 (forall ((v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (= .cse12 0)))))) .cse13 .cse14 .cse15)) (= .cse16 0) (= .cse4 |c_ULTIMATE.start_main_~p~0#1.base|) (or (let ((.cse22 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse52 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse52)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))))) (.cse23 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse50 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_31 .cse50) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse50))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse51 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse51))))))) (.cse24 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse49 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) (.cse25 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse48 0))))))) (.cse26 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse47 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse47 0)))))))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse18 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= .cse17 .cse18) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse18) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse19)))))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse20 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= (select v_arrayElimArr_31 .cse20) 0)) (not (= .cse21 .cse20)) (= .cse21 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse22 .cse23 .cse24 .cse25 .cse26) .cse27) (or .cse5 (and .cse22 .cse23 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse28 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_31 .cse28) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse28))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse29)))))) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= .cse30 0)))))) .cse24 .cse25 (forall ((v_arrayElimArr_31 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) (not (= .cse32 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (= .cse32 0)))) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) .cse26)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse33 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse33 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse34 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse35) (= .cse35 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse37 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse36 .cse37) (= .cse36 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse37) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse38) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_arrayElimArr_31 (Array Int Int))) (or (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse39 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse39 0)))) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse41 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse40 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse40 .cse41) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse41) 0)) (= .cse40 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse43) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse44 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse46 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse46 0)))))))) .cse53) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse55 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse54 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse54 .cse55) (= .cse54 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse55) 0)) (= .cse54 0)))))) (not .cse27) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse56 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse56 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse56 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse57 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse57) (= .cse57 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse58 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse58 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse58 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or (and .cse6 .cse11 .cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse59 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse60 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= (select v_arrayElimArr_31 .cse59) 0)) (not (= .cse60 .cse59)) (= .cse60 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) .cse14 .cse15) .cse27) .cse53 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse61 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse62 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= .cse61 .cse62) (= .cse61 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse62) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse63 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse63 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse63)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse64 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse64 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse64) (= .cse64 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse65 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse65 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse65 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse66 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse66 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse66 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (= .cse16 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse67 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse67 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse68 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse68) (= .cse68 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) is different from false [2022-07-22 14:37:23,152 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 v_ArrVal_682)))) (store .cse6 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse6 |v_ULTIMATE.start_main_~p~0#1.base_87|) 0 3))))) (let ((.cse3 (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 0)) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (not (= 2 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= 3 .cse3) (= 2 .cse3)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-07-22 14:37:23,160 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 v_ArrVal_682)))) (store .cse6 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse6 |v_ULTIMATE.start_main_~p~0#1.base_87|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse3 (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (not (= (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (= .cse3 3) (= .cse3 2)))))) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-07-22 14:37:25,167 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse5 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse3 (select |c_#memory_int| .cse1))) (and (= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse2 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2) (and (not (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse2) (= (select .cse3 .cse4) 2) .cse5))) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse4 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (not (= 2 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse6 (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) (or (= 2 .cse6) (= 3 .cse6)))))) .cse5 (= 2 (select .cse3 0))))) is different from false [2022-07-22 14:37:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:25,456 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-07-22 14:37:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 14:37:25,457 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 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 27 [2022-07-22 14:37:25,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:25,457 INFO L225 Difference]: With dead ends: 76 [2022-07-22 14:37:25,457 INFO L226 Difference]: Without dead ends: 72 [2022-07-22 14:37:25,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=184, Invalid=1400, Unknown=8, NotChecked=664, Total=2256 [2022-07-22 14:37:25,458 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:37:25,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 250 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 221 Invalid, 0 Unknown, 278 Unchecked, 0.1s Time] [2022-07-22 14:37:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-22 14:37:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-07-22 14:37:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-07-22 14:37:25,484 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 27 [2022-07-22 14:37:25,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:25,485 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-07-22 14:37:25,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-07-22 14:37:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 14:37:25,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:25,486 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:25,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 14:37:25,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 14:37:25,703 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:25,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:25,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1736025984, now seen corresponding path program 4 times [2022-07-22 14:37:25,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:25,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993329775] [2022-07-22 14:37:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:25,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:25,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:25,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993329775] [2022-07-22 14:37:25,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993329775] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:37:25,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649829039] [2022-07-22 14:37:25,968 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 14:37:25,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:37:25,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:37:25,969 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:37:25,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 14:37:26,088 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 14:37:26,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:37:26,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-22 14:37:26,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:37:26,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:37:26,134 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 14:37:26,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 14:37:26,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:37:26,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:37:26,228 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:37:26,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-22 14:37:26,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:37:26,242 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:37:26,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-22 14:37:26,278 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-22 14:37:26,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-22 14:37:26,325 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-07-22 14:37:26,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 75 [2022-07-22 14:37:26,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2022-07-22 14:37:26,399 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-22 14:37:26,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 132 [2022-07-22 14:37:26,413 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-22 14:37:26,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 121 [2022-07-22 14:37:26,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-07-22 14:37:26,556 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-22 14:37:26,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 58 [2022-07-22 14:37:26,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 19 [2022-07-22 14:37:26,601 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:37:26,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-07-22 14:37:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:26,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:37:26,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:26,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 205 [2022-07-22 14:37:26,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:26,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-07-22 14:37:26,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:26,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2022-07-22 14:37:26,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:26,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-07-22 14:37:27,002 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:27,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2022-07-22 14:37:27,013 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:27,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-07-22 14:37:27,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:27,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2022-07-22 14:37:27,029 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:27,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-07-22 14:37:27,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:27,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2022-07-22 14:37:27,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:27,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 82 [2022-07-22 14:37:27,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:27,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2022-07-22 14:37:27,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:27,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2349 treesize of output 1710 [2022-07-22 14:37:27,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:27,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:27,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 704 treesize of output 605 [2022-07-22 14:37:27,384 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:27,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 603 treesize of output 471 [2022-07-22 14:37:27,423 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:27,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 376 treesize of output 404 [2022-07-22 14:37:27,458 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:27,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 344 treesize of output 348 [2022-07-22 14:37:31,804 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:31,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2022-07-22 14:37:31,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:31,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 90 [2022-07-22 14:37:31,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:31,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 665 treesize of output 470 [2022-07-22 14:37:31,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:32,113 INFO L356 Elim1Store]: treesize reduction 222, result has 58.7 percent of original size [2022-07-22 14:37:32,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 2560 treesize of output 2313 [2022-07-22 14:37:32,183 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:32,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1133 treesize of output 861 [2022-07-22 14:37:32,235 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:32,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 511 treesize of output 459 [2022-07-22 14:37:32,274 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:32,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 646 treesize of output 626 [2022-07-22 14:37:32,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 77 [2022-07-22 14:37:35,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:35,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 82 [2022-07-22 14:37:35,398 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:35,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2022-07-22 14:37:35,457 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:35,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2412 treesize of output 1791 [2022-07-22 14:37:35,486 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:35,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5662 treesize of output 5299 [2022-07-22 14:37:35,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:35,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5290 treesize of output 3658 [2022-07-22 14:37:35,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3640 treesize of output 3144 [2022-07-22 14:37:35,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:35,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 2962 treesize of output 3000 [2022-07-22 14:37:35,720 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:35,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2934 treesize of output 2882 [2022-07-22 14:40:30,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:30,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2022-07-22 14:40:30,873 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:30,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 90 [2022-07-22 14:40:30,882 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:30,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 346 treesize of output 247 [2022-07-22 14:40:30,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:40:31,177 INFO L356 Elim1Store]: treesize reduction 222, result has 58.7 percent of original size [2022-07-22 14:40:31,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 1232 treesize of output 1289 [2022-07-22 14:40:31,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:31,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1118 treesize of output 882 [2022-07-22 14:40:31,300 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:31,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 505 treesize of output 457 [2022-07-22 14:40:31,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 782 treesize of output 718 [2022-07-22 14:40:31,383 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:31,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 594 treesize of output 598 [2022-07-22 14:40:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:40:51,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649829039] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:40:51,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:40:51,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 31 [2022-07-22 14:40:51,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319237978] [2022-07-22 14:40:51,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:40:51,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-22 14:40:51,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:40:51,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-22 14:40:51,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=827, Unknown=4, NotChecked=0, Total=930 [2022-07-22 14:40:51,364 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 31 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:40:52,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:40:52,124 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-07-22 14:40:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 14:40:52,125 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-22 14:40:52,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:40:52,125 INFO L225 Difference]: With dead ends: 84 [2022-07-22 14:40:52,125 INFO L226 Difference]: Without dead ends: 79 [2022-07-22 14:40:52,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=192, Invalid=1526, Unknown=4, NotChecked=0, Total=1722 [2022-07-22 14:40:52,126 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:40:52,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 236 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 213 Invalid, 0 Unknown, 142 Unchecked, 0.2s Time] [2022-07-22 14:40:52,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-22 14:40:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-07-22 14:40:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:40:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-07-22 14:40:52,138 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 29 [2022-07-22 14:40:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:40:52,138 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-07-22 14:40:52,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:40:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-07-22 14:40:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 14:40:52,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:40:52,139 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:40:52,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 14:40:52,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-22 14:40:52,358 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:40:52,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:40:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash -408767179, now seen corresponding path program 3 times [2022-07-22 14:40:52,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:40:52,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786160000] [2022-07-22 14:40:52,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:40:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:40:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:40:52,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:40:52,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786160000] [2022-07-22 14:40:52,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786160000] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:40:52,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526531019] [2022-07-22 14:40:52,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 14:40:52,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:52,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:40:52,708 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:40:52,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 14:40:52,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 14:40:52,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:40:52,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-22 14:40:52,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:40:52,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:40:52,912 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 14:40:52,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 14:40:52,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:40:52,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:40:52,999 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:40:53,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-07-22 14:40:53,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:40:53,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-22 14:40:53,021 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-22 14:40:53,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-22 14:40:53,066 INFO L356 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2022-07-22 14:40:53,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 85 [2022-07-22 14:40:53,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 96 [2022-07-22 14:40:53,130 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-22 14:40:53,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 139 [2022-07-22 14:40:53,144 INFO L356 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-07-22 14:40:53,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 138 [2022-07-22 14:40:53,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2022-07-22 14:40:53,241 INFO L356 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2022-07-22 14:40:53,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 53 [2022-07-22 14:40:53,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2022-07-22 14:40:53,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:40:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:40:53,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:40:53,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 129 [2022-07-22 14:40:53,291 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_862 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_862)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))))) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_862 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_864))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_862) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 4)))))) is different from false [2022-07-22 14:40:53,633 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:53,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-07-22 14:40:53,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:53,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2022-07-22 14:40:53,649 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:53,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-07-22 14:40:53,655 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:53,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2022-07-22 14:40:53,786 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:53,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2022-07-22 14:40:53,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:53,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 90 [2022-07-22 14:40:53,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:53,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 332 treesize of output 239 [2022-07-22 14:40:54,425 INFO L356 Elim1Store]: treesize reduction 574, result has 48.8 percent of original size [2022-07-22 14:40:54,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 2888 treesize of output 3071 [2022-07-22 14:40:54,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:54,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2718 treesize of output 1862 [2022-07-22 14:40:54,632 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:40:54,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1740 treesize of output 1540 [2022-07-22 14:40:54,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 219 [2022-07-22 14:40:54,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 199