./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array23_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/array-patterns/array23_pattern.c -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 e6bb9e1c9705c406859f1248122e92b7c01da6449c586b213f4fa087ea45e218 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:00:21,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:00:21,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:00:22,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:00:22,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:00:22,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:00:22,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:00:22,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:00:22,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:00:22,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:00:22,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:00:22,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:00:22,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:00:22,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:00:22,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:00:22,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:00:22,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:00:22,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:00:22,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:00:22,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:00:22,049 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:00:22,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:00:22,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:00:22,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:00:22,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:00:22,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:00:22,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:00:22,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:00:22,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:00:22,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:00:22,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:00:22,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:00:22,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:00:22,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:00:22,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:00:22,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:00:22,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:00:22,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:00:22,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:00:22,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:00:22,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:00:22,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:00:22,065 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:00:22,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:00:22,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:00:22,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:00:22,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:00:22,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:00:22,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:00:22,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:00:22,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:00:22,095 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:00:22,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:00:22,095 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:00:22,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:00:22,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:00:22,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:00:22,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:00:22,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:00:22,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:00:22,096 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:00:22,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:00:22,097 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:00:22,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:00:22,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:00:22,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:00:22,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:00:22,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:00:22,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:00:22,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:00:22,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:00:22,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:00:22,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:00:22,107 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:00:22,108 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:00:22,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:00:22,108 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 -> e6bb9e1c9705c406859f1248122e92b7c01da6449c586b213f4fa087ea45e218 [2022-07-11 23:00:22,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:00:22,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:00:22,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:00:22,328 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:00:22,331 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:00:22,332 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array23_pattern.c [2022-07-11 23:00:22,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69ef39e9/3c8f9d0aeed74afa8a8cca2c60c549bc/FLAG47e3f9d71 [2022-07-11 23:00:22,750 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:00:22,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array23_pattern.c [2022-07-11 23:00:22,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69ef39e9/3c8f9d0aeed74afa8a8cca2c60c549bc/FLAG47e3f9d71 [2022-07-11 23:00:22,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69ef39e9/3c8f9d0aeed74afa8a8cca2c60c549bc [2022-07-11 23:00:22,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:00:22,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:00:22,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:00:22,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:00:22,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:00:22,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:00:22" (1/1) ... [2022-07-11 23:00:22,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@83bcf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:00:22, skipping insertion in model container [2022-07-11 23:00:22,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:00:22" (1/1) ... [2022-07-11 23:00:22,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:00:22,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:00:22,907 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/array-patterns/array23_pattern.c[1347,1360] [2022-07-11 23:00:22,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:00:22,944 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:00:22,957 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/array-patterns/array23_pattern.c[1347,1360] [2022-07-11 23:00:22,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:00:22,988 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:00:22,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:00:22 WrapperNode [2022-07-11 23:00:22,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:00:22,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:00:22,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:00:22,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:00:22,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:00:22" (1/1) ... [2022-07-11 23:00:23,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:00:22" (1/1) ... [2022-07-11 23:00:23,028 INFO L137 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2022-07-11 23:00:23,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:00:23,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:00:23,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:00:23,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:00:23,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:00:22" (1/1) ... [2022-07-11 23:00:23,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:00:22" (1/1) ... [2022-07-11 23:00:23,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:00:22" (1/1) ... [2022-07-11 23:00:23,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:00:22" (1/1) ... [2022-07-11 23:00:23,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:00:22" (1/1) ... [2022-07-11 23:00:23,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:00:22" (1/1) ... [2022-07-11 23:00:23,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:00:22" (1/1) ... [2022-07-11 23:00:23,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:00:23,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:00:23,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:00:23,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:00:23,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:00:22" (1/1) ... [2022-07-11 23:00:23,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:00:23,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:00:23,100 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-11 23:00:23,114 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-11 23:00:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure outerBoundaryPatternCheck [2022-07-11 23:00:23,126 INFO L138 BoogieDeclarations]: Found implementation of procedure outerBoundaryPatternCheck [2022-07-11 23:00:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:00:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-11 23:00:23,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-11 23:00:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:00:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:00:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:00:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:00:23,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:00:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:00:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:00:23,174 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:00:23,175 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:00:23,407 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:00:23,411 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:00:23,412 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-11 23:00:23,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:00:23 BoogieIcfgContainer [2022-07-11 23:00:23,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:00:23,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:00:23,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:00:23,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:00:23,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:00:22" (1/3) ... [2022-07-11 23:00:23,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526069a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:00:23, skipping insertion in model container [2022-07-11 23:00:23,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:00:22" (2/3) ... [2022-07-11 23:00:23,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526069a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:00:23, skipping insertion in model container [2022-07-11 23:00:23,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:00:23" (3/3) ... [2022-07-11 23:00:23,436 INFO L111 eAbstractionObserver]: Analyzing ICFG array23_pattern.c [2022-07-11 23:00:23,446 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:00:23,448 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:00:23,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:00:23,496 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@2589f897, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5bd1ec1b [2022-07-11 23:00:23,496 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:00:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-11 23:00:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-11 23:00:23,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:00:23,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:00:23,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:00:23,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:00:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1798908762, now seen corresponding path program 1 times [2022-07-11 23:00:23,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:00:23,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877091166] [2022-07-11 23:00:23,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:00:23,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:00:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:00:23,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:00:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:00:23,595 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-11 23:00:23,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:00:23,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877091166] [2022-07-11 23:00:23,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877091166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:00:23,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:00:23,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:00:23,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829069551] [2022-07-11 23:00:23,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:00:23,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:00:23,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:00:23,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:00:23,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:00:23,627 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:00:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:00:23,647 INFO L93 Difference]: Finished difference Result 79 states and 117 transitions. [2022-07-11 23:00:23,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:00:23,649 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-11 23:00:23,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:00:23,653 INFO L225 Difference]: With dead ends: 79 [2022-07-11 23:00:23,653 INFO L226 Difference]: Without dead ends: 37 [2022-07-11 23:00:23,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-11 23:00:23,658 INFO L413 NwaCegarLoop]: 51 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, 51 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-11 23:00:23,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:00:23,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-11 23:00:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-11 23:00:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-11 23:00:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-07-11 23:00:23,684 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 15 [2022-07-11 23:00:23,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:00:23,684 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-07-11 23:00:23,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:00:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-07-11 23:00:23,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-11 23:00:23,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:00:23,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:00:23,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:00:23,689 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:00:23,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:00:23,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1909329698, now seen corresponding path program 1 times [2022-07-11 23:00:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:00:23,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123904873] [2022-07-11 23:00:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:00:23,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:00:23,719 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:00:23,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449505270] [2022-07-11 23:00:23,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:00:23,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:00:23,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:00:23,727 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-11 23:00:23,728 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-11 23:00:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:00:23,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:00:23,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:00:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:00:23,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:00:23,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:00:23,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123904873] [2022-07-11 23:00:23,900 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:00:23,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449505270] [2022-07-11 23:00:23,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449505270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:00:23,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:00:23,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:00:23,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648689137] [2022-07-11 23:00:23,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:00:23,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:00:23,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:00:23,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:00:23,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:00:23,905 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:00:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:00:23,934 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-07-11 23:00:23,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:00:23,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-07-11 23:00:23,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:00:23,937 INFO L225 Difference]: With dead ends: 44 [2022-07-11 23:00:23,937 INFO L226 Difference]: Without dead ends: 40 [2022-07-11 23:00:23,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:00:23,939 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:00:23,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:00:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-11 23:00:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-11 23:00:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-11 23:00:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-07-11 23:00:23,959 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 42 [2022-07-11 23:00:23,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:00:23,960 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-07-11 23:00:23,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:00:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-07-11 23:00:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-11 23:00:23,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:00:23,962 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:00:23,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:00:24,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:00:24,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:00:24,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:00:24,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1786751912, now seen corresponding path program 1 times [2022-07-11 23:00:24,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:00:24,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023550118] [2022-07-11 23:00:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:00:24,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:00:24,200 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:00:24,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415874059] [2022-07-11 23:00:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:00:24,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:00:24,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:00:24,205 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-11 23:00:24,208 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-11 23:00:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:00:24,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 23:00:24,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:00:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:00:24,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:00:24,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:00:24,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023550118] [2022-07-11 23:00:24,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:00:24,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415874059] [2022-07-11 23:00:24,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415874059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:00:24,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:00:24,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:00:24,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582812944] [2022-07-11 23:00:24,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:00:24,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:00:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:00:24,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:00:24,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:00:24,342 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:00:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:00:24,410 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2022-07-11 23:00:24,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:00:24,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2022-07-11 23:00:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:00:24,412 INFO L225 Difference]: With dead ends: 83 [2022-07-11 23:00:24,412 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 23:00:24,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:00:24,413 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 25 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:00:24,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 128 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:00:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 23:00:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-07-11 23:00:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-11 23:00:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-07-11 23:00:24,417 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 47 [2022-07-11 23:00:24,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:00:24,417 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-07-11 23:00:24,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:00:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-07-11 23:00:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-11 23:00:24,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:00:24,418 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:00:24,437 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-11 23:00:24,635 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,SelfDestructingSolverStorable2 [2022-07-11 23:00:24,636 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:00:24,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:00:24,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2075657686, now seen corresponding path program 1 times [2022-07-11 23:00:24,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:00:24,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470162972] [2022-07-11 23:00:24,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:00:24,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:00:24,649 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:00:24,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147062247] [2022-07-11 23:00:24,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:00:24,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:00:24,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:00:24,656 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-11 23:00:24,658 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-11 23:00:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:00:24,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 23:00:24,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:00:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-11 23:00:24,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:00:24,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:00:24,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470162972] [2022-07-11 23:00:24,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:00:24,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147062247] [2022-07-11 23:00:24,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147062247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:00:24,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:00:24,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:00:24,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669996086] [2022-07-11 23:00:24,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:00:24,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:00:24,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:00:24,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:00:24,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:00:24,745 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:00:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:00:24,784 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2022-07-11 23:00:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:00:24,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-07-11 23:00:24,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:00:24,787 INFO L225 Difference]: With dead ends: 80 [2022-07-11 23:00:24,788 INFO L226 Difference]: Without dead ends: 44 [2022-07-11 23:00:24,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:00:24,789 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:00:24,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 77 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:00:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-11 23:00:24,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2022-07-11 23:00:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-11 23:00:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-07-11 23:00:24,798 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 50 [2022-07-11 23:00:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:00:24,798 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-07-11 23:00:24,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:00:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-07-11 23:00:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:00:24,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:00:24,800 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:00:24,818 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-11 23:00:25,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:00:25,007 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:00:25,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:00:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash 874891816, now seen corresponding path program 1 times [2022-07-11 23:00:25,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:00:25,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236311151] [2022-07-11 23:00:25,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:00:25,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:00:25,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:00:25,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257489726] [2022-07-11 23:00:25,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:00:25,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:00:25,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:00:25,042 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-11 23:00:25,043 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-11 23:00:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:00:25,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:00:25,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:00:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-11 23:00:25,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:00:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:00:25,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:00:25,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236311151] [2022-07-11 23:00:25,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:00:25,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257489726] [2022-07-11 23:00:25,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257489726] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:00:25,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:00:25,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-07-11 23:00:25,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268804137] [2022-07-11 23:00:25,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:00:25,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:00:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:00:25,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:00:25,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:00:25,229 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-11 23:00:25,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:00:25,335 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2022-07-11 23:00:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:00:25,337 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 52 [2022-07-11 23:00:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:00:25,338 INFO L225 Difference]: With dead ends: 87 [2022-07-11 23:00:25,338 INFO L226 Difference]: Without dead ends: 51 [2022-07-11 23:00:25,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:00:25,340 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 80 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:00:25,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 105 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:00:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-11 23:00:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-07-11 23:00:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-11 23:00:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-07-11 23:00:25,346 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 52 [2022-07-11 23:00:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:00:25,346 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-07-11 23:00:25,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-11 23:00:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-07-11 23:00:25,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-11 23:00:25,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:00:25,347 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:00:25,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:00:25,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:00:25,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:00:25,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:00:25,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1211966936, now seen corresponding path program 2 times [2022-07-11 23:00:25,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:00:25,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300039737] [2022-07-11 23:00:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:00:25,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:00:25,587 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:00:25,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269317033] [2022-07-11 23:00:25,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:00:25,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:00:25,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:00:25,589 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-11 23:00:25,591 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-11 23:00:25,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:00:25,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:00:25,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:00:25,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:00:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:00:25,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:00:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-11 23:00:25,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:00:25,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300039737] [2022-07-11 23:00:25,718 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:00:25,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269317033] [2022-07-11 23:00:25,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269317033] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:00:25,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:00:25,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-07-11 23:00:25,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688979218] [2022-07-11 23:00:25,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:00:25,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:00:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:00:25,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:00:25,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:00:25,720 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-11 23:00:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:00:25,854 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2022-07-11 23:00:25,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:00:25,854 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2022-07-11 23:00:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:00:25,855 INFO L225 Difference]: With dead ends: 108 [2022-07-11 23:00:25,855 INFO L226 Difference]: Without dead ends: 75 [2022-07-11 23:00:25,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:00:25,856 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 51 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:00:25,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 181 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:00:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-11 23:00:25,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2022-07-11 23:00:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-11 23:00:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-07-11 23:00:25,862 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 56 [2022-07-11 23:00:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:00:25,862 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-07-11 23:00:25,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-11 23:00:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-07-11 23:00:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-11 23:00:25,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:00:25,863 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:00:25,881 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-11 23:00:26,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:00:26,075 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:00:26,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:00:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash -511912674, now seen corresponding path program 3 times [2022-07-11 23:00:26,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:00:26,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273390856] [2022-07-11 23:00:26,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:00:26,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:00:26,085 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:00:26,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703323525] [2022-07-11 23:00:26,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:00:26,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:00:26,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:00:26,087 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-11 23:00:26,088 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-11 23:00:26,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-11 23:00:26,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:00:26,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 102 conjunts are in the unsatisfiable core [2022-07-11 23:00:26,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:00:27,019 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 0 case distinctions, treesize of input 61 treesize of output 56 [2022-07-11 23:00:27,024 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 19 treesize of output 18 [2022-07-11 23:00:27,029 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 21 treesize of output 20 [2022-07-11 23:00:27,104 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 0 case distinctions, treesize of input 74 treesize of output 67 [2022-07-11 23:00:27,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:00:27,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 143 [2022-07-11 23:00:27,137 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-11 23:00:27,301 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 0 case distinctions, treesize of input 77 treesize of output 68 [2022-07-11 23:00:27,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 150 [2022-07-11 23:00:27,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:00:27,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 22 [2022-07-11 23:00:27,454 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 0 case distinctions, treesize of input 96 treesize of output 85 [2022-07-11 23:00:27,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:27,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 187 [2022-07-11 23:00:28,281 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 0 case distinctions, treesize of input 108 treesize of output 95 [2022-07-11 23:00:28,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,400 INFO L356 Elim1Store]: treesize reduction 288, result has 14.0 percent of original size [2022-07-11 23:00:28,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 205 [2022-07-11 23:00:28,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:28,531 INFO L356 Elim1Store]: treesize reduction 479, result has 14.6 percent of original size [2022-07-11 23:00:28,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 157 treesize of output 133 [2022-07-11 23:00:30,119 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 0 case distinctions, treesize of input 304 treesize of output 285 [2022-07-11 23:00:30,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:30,502 INFO L356 Elim1Store]: treesize reduction 497, result has 0.2 percent of original size [2022-07-11 23:00:30,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 5 select indices, 5 select index equivalence classes, 25 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 288 treesize of output 975 [2022-07-11 23:00:41,914 WARN L833 $PredicateComparison]: unable to prove that (and (or (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse4 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse1 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse4) 4)) (.cse2 (* .cse4 4)) (.cse3 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (- 1) (select .cse0 (+ .cse1 (* .cse2 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3))) (= (select .cse0 (+ .cse1 (* |ULTIMATE.start_main_~index1~0#1| .cse2) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3)) 1) (< (* |ULTIMATE.start_main_~index1~0#1| 4294967296) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse4))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse19 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse9 (* .cse19 4))) (let ((.cse15 (+ (- 17179869184) .cse9)) (.cse16 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse19) 4)) (.cse17 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse18 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse14 (+ (- 4294967296) .cse18)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse13 (+ .cse16 (* .cse9 .cse18) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17)) (.cse8 (+ (* .cse15 .cse18) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse7 (store (store .cse12 .cse13 v_prenex_1) .cse8 (- 1))) (.cse5 (store .cse12 .cse13 v_DerPreprocessor_11)) (.cse6 (+ .cse16 (* .cse14 .cse9) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (and (= (store (store .cse5 .cse6 (select .cse7 .cse6)) .cse8 (- 1)) .cse7) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9)) 0) (let ((.cse11 (+ (* .cse14 .cse15) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse10 (store (store .cse12 .cse13 v_DerPreprocessor_7) .cse11 (- 1)))) (= .cse10 (store (store .cse5 .cse6 (select .cse10 .cse6)) .cse11 (- 1))))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9 4)) 0) (= (select (store .cse5 .cse6 (- 1)) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0)))))))) (<= 0 |ULTIMATE.start_main_~index1~0#1|))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse24 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse21 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse24) 4)) (.cse22 (* .cse24 4)) (.cse23 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (select .cse20 (+ .cse21 (* |ULTIMATE.start_main_~index1~0#1| .cse22) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23)) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< (+ (* |ULTIMATE.start_main_~index1~0#1| 4294967296) 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse24))) (= (- 1) (select .cse20 (+ .cse21 (* .cse22 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse39 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse26 (* .cse39 4))) (let ((.cse35 (+ (- 17179869184) .cse26)) (.cse36 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse39) 4)) (.cse37 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse38 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse34 (+ (- 4294967296) .cse38)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse33 (+ .cse36 (* .cse26 .cse38) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37)) (.cse29 (+ (* .cse35 .cse38) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse25 (store (store .cse32 .cse33 v_prenex_1) .cse29 (- 1))) (.cse27 (store .cse32 .cse33 v_DerPreprocessor_11)) (.cse28 (+ .cse36 (* .cse34 .cse26) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (and (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26 4)) 0) (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26)) 0) (= .cse25 (store (store .cse27 .cse28 (select .cse25 .cse28)) .cse29 (- 1))) (= (select (store .cse27 .cse28 (- 1)) |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (let ((.cse31 (+ (* .cse34 .cse35) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse30 (store (store .cse32 .cse33 v_DerPreprocessor_7) .cse31 (- 1)))) (= (store (store .cse27 .cse28 (select .cse30 .cse28)) .cse31 (- 1)) .cse30)))))))))))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse58 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse60 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse58) 4)) (.cse61 (* .cse58 4))) (and (exists ((v_prenex_2 Int)) (let ((.cse45 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse44 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse45) 4)) (.cse43 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse42 (* .cse45 4))) (let ((.cse41 (+ .cse44 (* .cse42 .cse43) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4))) (let ((.cse40 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse41 v_prenex_2) (+ (* (+ (- 17179869184) .cse42) .cse43) .cse44 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4) (- 1)))) (and (= (select .cse40 .cse41) v_prenex_2) (= (select .cse40 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42)) 0))))))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse57 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse54 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse57) 4)) (.cse53 (* .cse57 4)) (.cse56 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse52 (+ (- 4294967296) .cse56)) (.cse50 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse51 (+ .cse54 (* .cse53 .cse56) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse46 (store .cse50 .cse51 v_DerPreprocessor_11)) (.cse47 (+ .cse54 (* .cse52 .cse53) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse55 (store .cse46 .cse47 (- 1)))) (and (let ((.cse49 (+ (* .cse52 (+ (- 17179869184) .cse53)) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse48 (store (store .cse50 .cse51 v_DerPreprocessor_7) .cse49 (- 1)))) (= (store (store .cse46 .cse47 (select .cse48 .cse47)) .cse49 (- 1)) .cse48))) (= (select .cse55 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse55 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0)))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (< (+ .cse58 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse58))) (= (select .cse59 (+ .cse60 (* |ULTIMATE.start_main_~index1~0#1| .cse61) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) 1) (= (select .cse59 (+ .cse60 (* .cse61 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) (- 1)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse71 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse68 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse69 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse71) 4)) (.cse70 (* .cse71 4))) (and (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_9 Int)) (let ((.cse67 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse66 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse67) 4)) (.cse65 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse64 (* .cse67 4))) (let ((.cse63 (+ .cse66 (* .cse64 .cse65) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64))) (let ((.cse62 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse63 v_DerPreprocessor_9) (+ (* (+ (- 17179869184) .cse64) .cse65) .cse66 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64) (- 1)))) (and (= v_DerPreprocessor_9 (select .cse62 .cse63)) (= (select .cse62 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64 4)) 0))))))) (= (select .cse68 (+ .cse69 (* |ULTIMATE.start_main_~index1~0#1| .cse70) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70)) 1) (= (- 1) (select .cse68 (+ .cse69 (* .cse70 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70))) (< .cse71 (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse71))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse83 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse80 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse83) 4)) (.cse79 (* .cse83 4)) (.cse82 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse78 (+ (- 4294967296) .cse82)) (.cse76 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse77 (+ .cse80 (* .cse79 .cse82) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse72 (store .cse76 .cse77 v_DerPreprocessor_11)) (.cse73 (+ .cse80 (* .cse78 .cse79) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse81 (store .cse72 .cse73 (- 1)))) (and (let ((.cse75 (+ (* .cse78 (+ (- 17179869184) .cse79)) .cse80 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse74 (store (store .cse76 .cse77 v_DerPreprocessor_7) .cse75 (- 1)))) (= (store (store .cse72 .cse73 (select .cse74 .cse73)) .cse75 (- 1)) .cse74))) (= (select .cse81 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse81 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))))))) (<= c_~ARR_SIZE~0 2) (< 1 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~#array~0#1.offset| 0) (= |c_ULTIMATE.start_main_~sum~0#1| 0)) is different from false [2022-07-11 23:00:51,583 WARN L833 $PredicateComparison]: unable to prove that (and (or (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse4 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse1 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse4) 4)) (.cse2 (* .cse4 4)) (.cse3 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (- 1) (select .cse0 (+ .cse1 (* .cse2 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3))) (= (select .cse0 (+ .cse1 (* |ULTIMATE.start_main_~index1~0#1| .cse2) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3)) 1) (< (* |ULTIMATE.start_main_~index1~0#1| 4294967296) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse4))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse19 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse9 (* .cse19 4))) (let ((.cse15 (+ (- 17179869184) .cse9)) (.cse16 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse19) 4)) (.cse17 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse18 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse14 (+ (- 4294967296) .cse18)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse13 (+ .cse16 (* .cse9 .cse18) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17)) (.cse8 (+ (* .cse15 .cse18) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse7 (store (store .cse12 .cse13 v_prenex_1) .cse8 (- 1))) (.cse5 (store .cse12 .cse13 v_DerPreprocessor_11)) (.cse6 (+ .cse16 (* .cse14 .cse9) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (and (= (store (store .cse5 .cse6 (select .cse7 .cse6)) .cse8 (- 1)) .cse7) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9)) 0) (let ((.cse11 (+ (* .cse14 .cse15) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse10 (store (store .cse12 .cse13 v_DerPreprocessor_7) .cse11 (- 1)))) (= .cse10 (store (store .cse5 .cse6 (select .cse10 .cse6)) .cse11 (- 1))))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9 4)) 0) (= (select (store .cse5 .cse6 (- 1)) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0)))))))) (<= 0 |ULTIMATE.start_main_~index1~0#1|))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse24 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse21 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse24) 4)) (.cse22 (* .cse24 4)) (.cse23 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (select .cse20 (+ .cse21 (* |ULTIMATE.start_main_~index1~0#1| .cse22) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23)) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< (+ (* |ULTIMATE.start_main_~index1~0#1| 4294967296) 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse24))) (= (- 1) (select .cse20 (+ .cse21 (* .cse22 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse39 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse26 (* .cse39 4))) (let ((.cse35 (+ (- 17179869184) .cse26)) (.cse36 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse39) 4)) (.cse37 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse38 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse34 (+ (- 4294967296) .cse38)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse33 (+ .cse36 (* .cse26 .cse38) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37)) (.cse29 (+ (* .cse35 .cse38) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse25 (store (store .cse32 .cse33 v_prenex_1) .cse29 (- 1))) (.cse27 (store .cse32 .cse33 v_DerPreprocessor_11)) (.cse28 (+ .cse36 (* .cse34 .cse26) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (and (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26 4)) 0) (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26)) 0) (= .cse25 (store (store .cse27 .cse28 (select .cse25 .cse28)) .cse29 (- 1))) (= (select (store .cse27 .cse28 (- 1)) |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (let ((.cse31 (+ (* .cse34 .cse35) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse30 (store (store .cse32 .cse33 v_DerPreprocessor_7) .cse31 (- 1)))) (= (store (store .cse27 .cse28 (select .cse30 .cse28)) .cse31 (- 1)) .cse30)))))))))))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse58 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse60 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse58) 4)) (.cse61 (* .cse58 4))) (and (exists ((v_prenex_2 Int)) (let ((.cse45 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse44 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse45) 4)) (.cse43 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse42 (* .cse45 4))) (let ((.cse41 (+ .cse44 (* .cse42 .cse43) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4))) (let ((.cse40 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse41 v_prenex_2) (+ (* (+ (- 17179869184) .cse42) .cse43) .cse44 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4) (- 1)))) (and (= (select .cse40 .cse41) v_prenex_2) (= (select .cse40 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42)) 0))))))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse57 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse54 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse57) 4)) (.cse53 (* .cse57 4)) (.cse56 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse52 (+ (- 4294967296) .cse56)) (.cse50 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse51 (+ .cse54 (* .cse53 .cse56) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse46 (store .cse50 .cse51 v_DerPreprocessor_11)) (.cse47 (+ .cse54 (* .cse52 .cse53) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse55 (store .cse46 .cse47 (- 1)))) (and (let ((.cse49 (+ (* .cse52 (+ (- 17179869184) .cse53)) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse48 (store (store .cse50 .cse51 v_DerPreprocessor_7) .cse49 (- 1)))) (= (store (store .cse46 .cse47 (select .cse48 .cse47)) .cse49 (- 1)) .cse48))) (= (select .cse55 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse55 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0)))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (< (+ .cse58 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse58))) (= (select .cse59 (+ .cse60 (* |ULTIMATE.start_main_~index1~0#1| .cse61) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) 1) (= (select .cse59 (+ .cse60 (* .cse61 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) (- 1)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse71 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse68 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse69 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse71) 4)) (.cse70 (* .cse71 4))) (and (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_9 Int)) (let ((.cse67 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse66 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse67) 4)) (.cse65 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse64 (* .cse67 4))) (let ((.cse63 (+ .cse66 (* .cse64 .cse65) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64))) (let ((.cse62 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse63 v_DerPreprocessor_9) (+ (* (+ (- 17179869184) .cse64) .cse65) .cse66 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64) (- 1)))) (and (= v_DerPreprocessor_9 (select .cse62 .cse63)) (= (select .cse62 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64 4)) 0))))))) (= (select .cse68 (+ .cse69 (* |ULTIMATE.start_main_~index1~0#1| .cse70) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70)) 1) (= (- 1) (select .cse68 (+ .cse69 (* .cse70 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70))) (< .cse71 (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse71))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse83 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse80 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse83) 4)) (.cse79 (* .cse83 4)) (.cse82 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse78 (+ (- 4294967296) .cse82)) (.cse76 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse77 (+ .cse80 (* .cse79 .cse82) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse72 (store .cse76 .cse77 v_DerPreprocessor_11)) (.cse73 (+ .cse80 (* .cse78 .cse79) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse81 (store .cse72 .cse73 (- 1)))) (and (let ((.cse75 (+ (* .cse78 (+ (- 17179869184) .cse79)) .cse80 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse74 (store (store .cse76 .cse77 v_DerPreprocessor_7) .cse75 (- 1)))) (= (store (store .cse72 .cse73 (select .cse74 .cse73)) .cse75 (- 1)) .cse74))) (= (select .cse81 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse81 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))))))) (<= c_~ARR_SIZE~0 2) (= |c_ULTIMATE.start_main_~row~0#1| 0) (< 1 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~#array~0#1.offset| 0) (= |c_ULTIMATE.start_main_~sum~0#1| 0)) is different from false [2022-07-11 23:00:58,740 WARN L833 $PredicateComparison]: unable to prove that (and (or (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse4 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse1 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse4) 4)) (.cse2 (* .cse4 4)) (.cse3 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (- 1) (select .cse0 (+ .cse1 (* .cse2 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3))) (= (select .cse0 (+ .cse1 (* |ULTIMATE.start_main_~index1~0#1| .cse2) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3)) 1) (< (* |ULTIMATE.start_main_~index1~0#1| 4294967296) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse4))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse19 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse9 (* .cse19 4))) (let ((.cse15 (+ (- 17179869184) .cse9)) (.cse16 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse19) 4)) (.cse17 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse18 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse14 (+ (- 4294967296) .cse18)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse13 (+ .cse16 (* .cse9 .cse18) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17)) (.cse8 (+ (* .cse15 .cse18) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse7 (store (store .cse12 .cse13 v_prenex_1) .cse8 (- 1))) (.cse5 (store .cse12 .cse13 v_DerPreprocessor_11)) (.cse6 (+ .cse16 (* .cse14 .cse9) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (and (= (store (store .cse5 .cse6 (select .cse7 .cse6)) .cse8 (- 1)) .cse7) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9)) 0) (let ((.cse11 (+ (* .cse14 .cse15) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse10 (store (store .cse12 .cse13 v_DerPreprocessor_7) .cse11 (- 1)))) (= .cse10 (store (store .cse5 .cse6 (select .cse10 .cse6)) .cse11 (- 1))))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9 4)) 0) (= (select (store .cse5 .cse6 (- 1)) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0)))))))) (<= 0 |ULTIMATE.start_main_~index1~0#1|))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse24 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse21 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse24) 4)) (.cse22 (* .cse24 4)) (.cse23 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (select .cse20 (+ .cse21 (* |ULTIMATE.start_main_~index1~0#1| .cse22) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23)) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< (+ (* |ULTIMATE.start_main_~index1~0#1| 4294967296) 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse24))) (= (- 1) (select .cse20 (+ .cse21 (* .cse22 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse39 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse26 (* .cse39 4))) (let ((.cse35 (+ (- 17179869184) .cse26)) (.cse36 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse39) 4)) (.cse37 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse38 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse34 (+ (- 4294967296) .cse38)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse33 (+ .cse36 (* .cse26 .cse38) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37)) (.cse29 (+ (* .cse35 .cse38) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse25 (store (store .cse32 .cse33 v_prenex_1) .cse29 (- 1))) (.cse27 (store .cse32 .cse33 v_DerPreprocessor_11)) (.cse28 (+ .cse36 (* .cse34 .cse26) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (and (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26 4)) 0) (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26)) 0) (= .cse25 (store (store .cse27 .cse28 (select .cse25 .cse28)) .cse29 (- 1))) (= (select (store .cse27 .cse28 (- 1)) |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (let ((.cse31 (+ (* .cse34 .cse35) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse30 (store (store .cse32 .cse33 v_DerPreprocessor_7) .cse31 (- 1)))) (= (store (store .cse27 .cse28 (select .cse30 .cse28)) .cse31 (- 1)) .cse30)))))))))))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse58 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse60 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse58) 4)) (.cse61 (* .cse58 4))) (and (exists ((v_prenex_2 Int)) (let ((.cse45 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse44 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse45) 4)) (.cse43 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse42 (* .cse45 4))) (let ((.cse41 (+ .cse44 (* .cse42 .cse43) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4))) (let ((.cse40 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse41 v_prenex_2) (+ (* (+ (- 17179869184) .cse42) .cse43) .cse44 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4) (- 1)))) (and (= (select .cse40 .cse41) v_prenex_2) (= (select .cse40 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42)) 0))))))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse57 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse54 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse57) 4)) (.cse53 (* .cse57 4)) (.cse56 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse52 (+ (- 4294967296) .cse56)) (.cse50 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse51 (+ .cse54 (* .cse53 .cse56) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse46 (store .cse50 .cse51 v_DerPreprocessor_11)) (.cse47 (+ .cse54 (* .cse52 .cse53) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse55 (store .cse46 .cse47 (- 1)))) (and (let ((.cse49 (+ (* .cse52 (+ (- 17179869184) .cse53)) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse48 (store (store .cse50 .cse51 v_DerPreprocessor_7) .cse49 (- 1)))) (= (store (store .cse46 .cse47 (select .cse48 .cse47)) .cse49 (- 1)) .cse48))) (= (select .cse55 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse55 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0)))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (< (+ .cse58 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse58))) (= (select .cse59 (+ .cse60 (* |ULTIMATE.start_main_~index1~0#1| .cse61) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) 1) (= (select .cse59 (+ .cse60 (* .cse61 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) (- 1)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse71 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse68 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse69 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse71) 4)) (.cse70 (* .cse71 4))) (and (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_9 Int)) (let ((.cse67 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse66 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse67) 4)) (.cse65 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse64 (* .cse67 4))) (let ((.cse63 (+ .cse66 (* .cse64 .cse65) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64))) (let ((.cse62 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse63 v_DerPreprocessor_9) (+ (* (+ (- 17179869184) .cse64) .cse65) .cse66 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64) (- 1)))) (and (= v_DerPreprocessor_9 (select .cse62 .cse63)) (= (select .cse62 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64 4)) 0))))))) (= (select .cse68 (+ .cse69 (* |ULTIMATE.start_main_~index1~0#1| .cse70) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70)) 1) (= (- 1) (select .cse68 (+ .cse69 (* .cse70 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70))) (< .cse71 (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse71))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse83 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse80 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse83) 4)) (.cse79 (* .cse83 4)) (.cse82 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse78 (+ (- 4294967296) .cse82)) (.cse76 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse77 (+ .cse80 (* .cse79 .cse82) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse72 (store .cse76 .cse77 v_DerPreprocessor_11)) (.cse73 (+ .cse80 (* .cse78 .cse79) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse81 (store .cse72 .cse73 (- 1)))) (and (let ((.cse75 (+ (* .cse78 (+ (- 17179869184) .cse79)) .cse80 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse74 (store (store .cse76 .cse77 v_DerPreprocessor_7) .cse75 (- 1)))) (= (store (store .cse72 .cse73 (select .cse74 .cse73)) .cse75 (- 1)) .cse74))) (= (select .cse81 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse81 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))))))) (<= c_~ARR_SIZE~0 2) (= |c_ULTIMATE.start_main_~row~0#1| 0) (< 1 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~#array~0#1.offset| 0) (= |c_ULTIMATE.start_main_~sum~0#1| 0) (= |c_ULTIMATE.start_main_~column~0#1| 0)) is different from false [2022-07-11 23:01:04,801 WARN L833 $PredicateComparison]: unable to prove that (and (or (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse4 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse1 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse4) 4)) (.cse2 (* .cse4 4)) (.cse3 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (- 1) (select .cse0 (+ .cse1 (* .cse2 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3))) (= (select .cse0 (+ .cse1 (* |ULTIMATE.start_main_~index1~0#1| .cse2) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3)) 1) (< (* |ULTIMATE.start_main_~index1~0#1| 4294967296) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse4))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse19 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse9 (* .cse19 4))) (let ((.cse15 (+ (- 17179869184) .cse9)) (.cse16 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse19) 4)) (.cse17 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse18 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse14 (+ (- 4294967296) .cse18)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse13 (+ .cse16 (* .cse9 .cse18) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17)) (.cse8 (+ (* .cse15 .cse18) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse7 (store (store .cse12 .cse13 v_prenex_1) .cse8 (- 1))) (.cse5 (store .cse12 .cse13 v_DerPreprocessor_11)) (.cse6 (+ .cse16 (* .cse14 .cse9) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (and (= (store (store .cse5 .cse6 (select .cse7 .cse6)) .cse8 (- 1)) .cse7) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9)) 0) (let ((.cse11 (+ (* .cse14 .cse15) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse10 (store (store .cse12 .cse13 v_DerPreprocessor_7) .cse11 (- 1)))) (= .cse10 (store (store .cse5 .cse6 (select .cse10 .cse6)) .cse11 (- 1))))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9 4)) 0) (= (select (store .cse5 .cse6 (- 1)) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0)))))))) (<= 0 |ULTIMATE.start_main_~index1~0#1|))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse24 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse21 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse24) 4)) (.cse22 (* .cse24 4)) (.cse23 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (select .cse20 (+ .cse21 (* |ULTIMATE.start_main_~index1~0#1| .cse22) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23)) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< (+ (* |ULTIMATE.start_main_~index1~0#1| 4294967296) 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse24))) (= (- 1) (select .cse20 (+ .cse21 (* .cse22 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse39 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse26 (* .cse39 4))) (let ((.cse35 (+ (- 17179869184) .cse26)) (.cse36 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse39) 4)) (.cse37 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse38 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse34 (+ (- 4294967296) .cse38)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse33 (+ .cse36 (* .cse26 .cse38) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37)) (.cse29 (+ (* .cse35 .cse38) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse25 (store (store .cse32 .cse33 v_prenex_1) .cse29 (- 1))) (.cse27 (store .cse32 .cse33 v_DerPreprocessor_11)) (.cse28 (+ .cse36 (* .cse34 .cse26) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (and (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26 4)) 0) (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26)) 0) (= .cse25 (store (store .cse27 .cse28 (select .cse25 .cse28)) .cse29 (- 1))) (= (select (store .cse27 .cse28 (- 1)) |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (let ((.cse31 (+ (* .cse34 .cse35) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse30 (store (store .cse32 .cse33 v_DerPreprocessor_7) .cse31 (- 1)))) (= (store (store .cse27 .cse28 (select .cse30 .cse28)) .cse31 (- 1)) .cse30)))))))))))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse58 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse60 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse58) 4)) (.cse61 (* .cse58 4))) (and (exists ((v_prenex_2 Int)) (let ((.cse45 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse44 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse45) 4)) (.cse43 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse42 (* .cse45 4))) (let ((.cse41 (+ .cse44 (* .cse42 .cse43) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4))) (let ((.cse40 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse41 v_prenex_2) (+ (* (+ (- 17179869184) .cse42) .cse43) .cse44 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4) (- 1)))) (and (= (select .cse40 .cse41) v_prenex_2) (= (select .cse40 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42)) 0))))))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse57 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse54 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse57) 4)) (.cse53 (* .cse57 4)) (.cse56 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse52 (+ (- 4294967296) .cse56)) (.cse50 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse51 (+ .cse54 (* .cse53 .cse56) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse46 (store .cse50 .cse51 v_DerPreprocessor_11)) (.cse47 (+ .cse54 (* .cse52 .cse53) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse55 (store .cse46 .cse47 (- 1)))) (and (let ((.cse49 (+ (* .cse52 (+ (- 17179869184) .cse53)) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse48 (store (store .cse50 .cse51 v_DerPreprocessor_7) .cse49 (- 1)))) (= (store (store .cse46 .cse47 (select .cse48 .cse47)) .cse49 (- 1)) .cse48))) (= (select .cse55 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse55 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0)))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (< (+ .cse58 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse58))) (= (select .cse59 (+ .cse60 (* |ULTIMATE.start_main_~index1~0#1| .cse61) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) 1) (= (select .cse59 (+ .cse60 (* .cse61 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) (- 1)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse71 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse68 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse69 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse71) 4)) (.cse70 (* .cse71 4))) (and (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_9 Int)) (let ((.cse67 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse66 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse67) 4)) (.cse65 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse64 (* .cse67 4))) (let ((.cse63 (+ .cse66 (* .cse64 .cse65) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64))) (let ((.cse62 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse63 v_DerPreprocessor_9) (+ (* (+ (- 17179869184) .cse64) .cse65) .cse66 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64) (- 1)))) (and (= v_DerPreprocessor_9 (select .cse62 .cse63)) (= (select .cse62 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64 4)) 0))))))) (= (select .cse68 (+ .cse69 (* |ULTIMATE.start_main_~index1~0#1| .cse70) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70)) 1) (= (- 1) (select .cse68 (+ .cse69 (* .cse70 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70))) (< .cse71 (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse71))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse83 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse80 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse83) 4)) (.cse79 (* .cse83 4)) (.cse82 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse78 (+ (- 4294967296) .cse82)) (.cse76 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse77 (+ .cse80 (* .cse79 .cse82) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse72 (store .cse76 .cse77 v_DerPreprocessor_11)) (.cse73 (+ .cse80 (* .cse78 .cse79) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse81 (store .cse72 .cse73 (- 1)))) (and (let ((.cse75 (+ (* .cse78 (+ (- 17179869184) .cse79)) .cse80 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse74 (store (store .cse76 .cse77 v_DerPreprocessor_7) .cse75 (- 1)))) (= (store (store .cse72 .cse73 (select .cse74 .cse73)) .cse75 (- 1)) .cse74))) (= (select .cse81 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse81 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))))))) (<= c_~ARR_SIZE~0 2) (= |c_ULTIMATE.start_main_~row~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| (* |c_ULTIMATE.start_main_~row~0#1| (* (mod c_~ARR_SIZE~0 4294967296) 4)) (* |c_ULTIMATE.start_main_~column~0#1| 4))) |c_ULTIMATE.start_main_~sum~0#1|) (< 1 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~#array~0#1.offset| 0) (= |c_ULTIMATE.start_main_~column~0#1| 0)) is different from false [2022-07-11 23:01:15,389 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| (* |c_ULTIMATE.start_main_~row~0#1| (* (mod c_~ARR_SIZE~0 4294967296) 4)))) |c_ULTIMATE.start_main_~sum~0#1|) (= |c_ULTIMATE.start_main_~column~0#1| 1) (or (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse4 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse1 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse4) 4)) (.cse2 (* .cse4 4)) (.cse3 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (- 1) (select .cse0 (+ .cse1 (* .cse2 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3))) (= (select .cse0 (+ .cse1 (* |ULTIMATE.start_main_~index1~0#1| .cse2) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3)) 1) (< (* |ULTIMATE.start_main_~index1~0#1| 4294967296) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse4))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse19 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse9 (* .cse19 4))) (let ((.cse15 (+ (- 17179869184) .cse9)) (.cse16 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse19) 4)) (.cse17 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse18 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse14 (+ (- 4294967296) .cse18)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse13 (+ .cse16 (* .cse9 .cse18) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17)) (.cse8 (+ (* .cse15 .cse18) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse7 (store (store .cse12 .cse13 v_prenex_1) .cse8 (- 1))) (.cse5 (store .cse12 .cse13 v_DerPreprocessor_11)) (.cse6 (+ .cse16 (* .cse14 .cse9) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (and (= (store (store .cse5 .cse6 (select .cse7 .cse6)) .cse8 (- 1)) .cse7) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9)) 0) (let ((.cse11 (+ (* .cse14 .cse15) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse10 (store (store .cse12 .cse13 v_DerPreprocessor_7) .cse11 (- 1)))) (= .cse10 (store (store .cse5 .cse6 (select .cse10 .cse6)) .cse11 (- 1))))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9 4)) 0) (= (select (store .cse5 .cse6 (- 1)) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0)))))))) (<= 0 |ULTIMATE.start_main_~index1~0#1|))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse24 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse21 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse24) 4)) (.cse22 (* .cse24 4)) (.cse23 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (select .cse20 (+ .cse21 (* |ULTIMATE.start_main_~index1~0#1| .cse22) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23)) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< (+ (* |ULTIMATE.start_main_~index1~0#1| 4294967296) 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse24))) (= (- 1) (select .cse20 (+ .cse21 (* .cse22 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse39 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse26 (* .cse39 4))) (let ((.cse35 (+ (- 17179869184) .cse26)) (.cse36 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse39) 4)) (.cse37 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse38 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse34 (+ (- 4294967296) .cse38)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse33 (+ .cse36 (* .cse26 .cse38) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37)) (.cse29 (+ (* .cse35 .cse38) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse25 (store (store .cse32 .cse33 v_prenex_1) .cse29 (- 1))) (.cse27 (store .cse32 .cse33 v_DerPreprocessor_11)) (.cse28 (+ .cse36 (* .cse34 .cse26) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (and (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26 4)) 0) (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26)) 0) (= .cse25 (store (store .cse27 .cse28 (select .cse25 .cse28)) .cse29 (- 1))) (= (select (store .cse27 .cse28 (- 1)) |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (let ((.cse31 (+ (* .cse34 .cse35) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse30 (store (store .cse32 .cse33 v_DerPreprocessor_7) .cse31 (- 1)))) (= (store (store .cse27 .cse28 (select .cse30 .cse28)) .cse31 (- 1)) .cse30)))))))))))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse58 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse60 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse58) 4)) (.cse61 (* .cse58 4))) (and (exists ((v_prenex_2 Int)) (let ((.cse45 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse44 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse45) 4)) (.cse43 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse42 (* .cse45 4))) (let ((.cse41 (+ .cse44 (* .cse42 .cse43) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4))) (let ((.cse40 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse41 v_prenex_2) (+ (* (+ (- 17179869184) .cse42) .cse43) .cse44 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4) (- 1)))) (and (= (select .cse40 .cse41) v_prenex_2) (= (select .cse40 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42)) 0))))))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse57 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse54 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse57) 4)) (.cse53 (* .cse57 4)) (.cse56 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse52 (+ (- 4294967296) .cse56)) (.cse50 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse51 (+ .cse54 (* .cse53 .cse56) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse46 (store .cse50 .cse51 v_DerPreprocessor_11)) (.cse47 (+ .cse54 (* .cse52 .cse53) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse55 (store .cse46 .cse47 (- 1)))) (and (let ((.cse49 (+ (* .cse52 (+ (- 17179869184) .cse53)) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse48 (store (store .cse50 .cse51 v_DerPreprocessor_7) .cse49 (- 1)))) (= (store (store .cse46 .cse47 (select .cse48 .cse47)) .cse49 (- 1)) .cse48))) (= (select .cse55 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse55 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0)))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (< (+ .cse58 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse58))) (= (select .cse59 (+ .cse60 (* |ULTIMATE.start_main_~index1~0#1| .cse61) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) 1) (= (select .cse59 (+ .cse60 (* .cse61 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) (- 1)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse71 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse68 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse69 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse71) 4)) (.cse70 (* .cse71 4))) (and (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_9 Int)) (let ((.cse67 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse66 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse67) 4)) (.cse65 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse64 (* .cse67 4))) (let ((.cse63 (+ .cse66 (* .cse64 .cse65) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64))) (let ((.cse62 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse63 v_DerPreprocessor_9) (+ (* (+ (- 17179869184) .cse64) .cse65) .cse66 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64) (- 1)))) (and (= v_DerPreprocessor_9 (select .cse62 .cse63)) (= (select .cse62 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64 4)) 0))))))) (= (select .cse68 (+ .cse69 (* |ULTIMATE.start_main_~index1~0#1| .cse70) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70)) 1) (= (- 1) (select .cse68 (+ .cse69 (* .cse70 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70))) (< .cse71 (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse71))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse83 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse80 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse83) 4)) (.cse79 (* .cse83 4)) (.cse82 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse78 (+ (- 4294967296) .cse82)) (.cse76 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse77 (+ .cse80 (* .cse79 .cse82) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse72 (store .cse76 .cse77 v_DerPreprocessor_11)) (.cse73 (+ .cse80 (* .cse78 .cse79) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse81 (store .cse72 .cse73 (- 1)))) (and (let ((.cse75 (+ (* .cse78 (+ (- 17179869184) .cse79)) .cse80 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse74 (store (store .cse76 .cse77 v_DerPreprocessor_7) .cse75 (- 1)))) (= (store (store .cse72 .cse73 (select .cse74 .cse73)) .cse75 (- 1)) .cse74))) (= (select .cse81 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse81 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))))))) (<= c_~ARR_SIZE~0 2) (= |c_ULTIMATE.start_main_~row~0#1| 0) (< 1 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~#array~0#1.offset| 0)) is different from false [2022-07-11 23:01:25,482 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~column~0#1| c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~sum~0#1| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~row~0#1| (* (mod c_~ARR_SIZE~0 4294967296) 4)))) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse1 (* |c_ULTIMATE.start_main_~column~0#1| 4))) (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse1))))) (= |c_ULTIMATE.start_main_~column~0#1| 1) (or (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse6 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse3 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse6) 4)) (.cse4 (* .cse6 4)) (.cse5 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (- 1) (select .cse2 (+ .cse3 (* .cse4 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse5))) (= (select .cse2 (+ .cse3 (* |ULTIMATE.start_main_~index1~0#1| .cse4) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse5)) 1) (< (* |ULTIMATE.start_main_~index1~0#1| 4294967296) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse6))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse21 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse11 (* .cse21 4))) (let ((.cse17 (+ (- 17179869184) .cse11)) (.cse18 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse21) 4)) (.cse19 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse20 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse16 (+ (- 4294967296) .cse20)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse15 (+ .cse18 (* .cse11 .cse20) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse19)) (.cse10 (+ (* .cse17 .cse20) .cse18 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse19))) (let ((.cse9 (store (store .cse14 .cse15 v_prenex_1) .cse10 (- 1))) (.cse7 (store .cse14 .cse15 v_DerPreprocessor_11)) (.cse8 (+ .cse18 (* .cse16 .cse11) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse19))) (and (= (store (store .cse7 .cse8 (select .cse9 .cse8)) .cse10 (- 1)) .cse9) (= (select .cse9 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse11)) 0) (let ((.cse13 (+ (* .cse16 .cse17) .cse18 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse19))) (let ((.cse12 (store (store .cse14 .cse15 v_DerPreprocessor_7) .cse13 (- 1)))) (= .cse12 (store (store .cse7 .cse8 (select .cse12 .cse8)) .cse13 (- 1))))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse11 4)) 0) (= (select (store .cse7 .cse8 (- 1)) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0)))))))) (<= 0 |ULTIMATE.start_main_~index1~0#1|))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse26 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse23 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse26) 4)) (.cse24 (* .cse26 4)) (.cse25 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (select .cse22 (+ .cse23 (* |ULTIMATE.start_main_~index1~0#1| .cse24) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse25)) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< (+ (* |ULTIMATE.start_main_~index1~0#1| 4294967296) 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse26))) (= (- 1) (select .cse22 (+ .cse23 (* .cse24 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse25))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse41 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse28 (* .cse41 4))) (let ((.cse37 (+ (- 17179869184) .cse28)) (.cse38 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse41) 4)) (.cse39 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse40 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse36 (+ (- 4294967296) .cse40)) (.cse34 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse35 (+ .cse38 (* .cse28 .cse40) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse39)) (.cse31 (+ (* .cse37 .cse40) .cse38 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse39))) (let ((.cse27 (store (store .cse34 .cse35 v_prenex_1) .cse31 (- 1))) (.cse29 (store .cse34 .cse35 v_DerPreprocessor_11)) (.cse30 (+ .cse38 (* .cse36 .cse28) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse39))) (and (= (select .cse27 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse28 4)) 0) (= (select .cse27 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse28)) 0) (= .cse27 (store (store .cse29 .cse30 (select .cse27 .cse30)) .cse31 (- 1))) (= (select (store .cse29 .cse30 (- 1)) |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (let ((.cse33 (+ (* .cse36 .cse37) .cse38 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse39))) (let ((.cse32 (store (store .cse34 .cse35 v_DerPreprocessor_7) .cse33 (- 1)))) (= (store (store .cse29 .cse30 (select .cse32 .cse30)) .cse33 (- 1)) .cse32)))))))))))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse60 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse61 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse62 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse60) 4)) (.cse63 (* .cse60 4))) (and (exists ((v_prenex_2 Int)) (let ((.cse47 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse46 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse47) 4)) (.cse45 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse44 (* .cse47 4))) (let ((.cse43 (+ .cse46 (* .cse44 .cse45) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse44 4))) (let ((.cse42 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse43 v_prenex_2) (+ (* (+ (- 17179869184) .cse44) .cse45) .cse46 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse44 4) (- 1)))) (and (= (select .cse42 .cse43) v_prenex_2) (= (select .cse42 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse44)) 0))))))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse59 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse56 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse59) 4)) (.cse55 (* .cse59 4)) (.cse58 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse54 (+ (- 4294967296) .cse58)) (.cse52 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse53 (+ .cse56 (* .cse55 .cse58) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse55 4))) (let ((.cse48 (store .cse52 .cse53 v_DerPreprocessor_11)) (.cse49 (+ .cse56 (* .cse54 .cse55) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse55 4))) (let ((.cse57 (store .cse48 .cse49 (- 1)))) (and (let ((.cse51 (+ (* .cse54 (+ (- 17179869184) .cse55)) .cse56 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse55 4))) (let ((.cse50 (store (store .cse52 .cse53 v_DerPreprocessor_7) .cse51 (- 1)))) (= (store (store .cse48 .cse49 (select .cse50 .cse49)) .cse51 (- 1)) .cse50))) (= (select .cse57 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse57 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0)))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (< (+ .cse60 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse60))) (= (select .cse61 (+ .cse62 (* |ULTIMATE.start_main_~index1~0#1| .cse63) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse63 4)) 1) (= (select .cse61 (+ .cse62 (* .cse63 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse63 4)) (- 1)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse73 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse70 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse71 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse73) 4)) (.cse72 (* .cse73 4))) (and (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_9 Int)) (let ((.cse69 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse68 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse69) 4)) (.cse67 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse66 (* .cse69 4))) (let ((.cse65 (+ .cse68 (* .cse66 .cse67) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse66))) (let ((.cse64 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse65 v_DerPreprocessor_9) (+ (* (+ (- 17179869184) .cse66) .cse67) .cse68 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse66) (- 1)))) (and (= v_DerPreprocessor_9 (select .cse64 .cse65)) (= (select .cse64 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse66 4)) 0))))))) (= (select .cse70 (+ .cse71 (* |ULTIMATE.start_main_~index1~0#1| .cse72) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse72)) 1) (= (- 1) (select .cse70 (+ .cse71 (* .cse72 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse72))) (< .cse73 (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse73))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse85 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse82 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse85) 4)) (.cse81 (* .cse85 4)) (.cse84 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse80 (+ (- 4294967296) .cse84)) (.cse78 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse79 (+ .cse82 (* .cse81 .cse84) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse81))) (let ((.cse74 (store .cse78 .cse79 v_DerPreprocessor_11)) (.cse75 (+ .cse82 (* .cse80 .cse81) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse81))) (let ((.cse83 (store .cse74 .cse75 (- 1)))) (and (let ((.cse77 (+ (* .cse80 (+ (- 17179869184) .cse81)) .cse82 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse81))) (let ((.cse76 (store (store .cse78 .cse79 v_DerPreprocessor_7) .cse77 (- 1)))) (= (store (store .cse74 .cse75 (select .cse76 .cse75)) .cse77 (- 1)) .cse76))) (= (select .cse83 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse83 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))))))) (<= c_~ARR_SIZE~0 2) (= |c_ULTIMATE.start_main_~row~0#1| 0) (= |c_ULTIMATE.start_main_~#array~0#1.offset| 0)) is different from false [2022-07-11 23:01:33,239 WARN L833 $PredicateComparison]: unable to prove that (and (or (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse4 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse1 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse4) 4)) (.cse2 (* .cse4 4)) (.cse3 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (- 1) (select .cse0 (+ .cse1 (* .cse2 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3))) (= (select .cse0 (+ .cse1 (* |ULTIMATE.start_main_~index1~0#1| .cse2) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3)) 1) (< (* |ULTIMATE.start_main_~index1~0#1| 4294967296) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse4))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse19 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse9 (* .cse19 4))) (let ((.cse15 (+ (- 17179869184) .cse9)) (.cse16 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse19) 4)) (.cse17 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse18 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse14 (+ (- 4294967296) .cse18)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse13 (+ .cse16 (* .cse9 .cse18) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17)) (.cse8 (+ (* .cse15 .cse18) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse7 (store (store .cse12 .cse13 v_prenex_1) .cse8 (- 1))) (.cse5 (store .cse12 .cse13 v_DerPreprocessor_11)) (.cse6 (+ .cse16 (* .cse14 .cse9) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (and (= (store (store .cse5 .cse6 (select .cse7 .cse6)) .cse8 (- 1)) .cse7) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9)) 0) (let ((.cse11 (+ (* .cse14 .cse15) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse10 (store (store .cse12 .cse13 v_DerPreprocessor_7) .cse11 (- 1)))) (= .cse10 (store (store .cse5 .cse6 (select .cse10 .cse6)) .cse11 (- 1))))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9 4)) 0) (= (select (store .cse5 .cse6 (- 1)) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0)))))))) (<= 0 |ULTIMATE.start_main_~index1~0#1|))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse24 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse21 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse24) 4)) (.cse22 (* .cse24 4)) (.cse23 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (select .cse20 (+ .cse21 (* |ULTIMATE.start_main_~index1~0#1| .cse22) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23)) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< (+ (* |ULTIMATE.start_main_~index1~0#1| 4294967296) 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse24))) (= (- 1) (select .cse20 (+ .cse21 (* .cse22 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse39 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse26 (* .cse39 4))) (let ((.cse35 (+ (- 17179869184) .cse26)) (.cse36 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse39) 4)) (.cse37 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse38 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse34 (+ (- 4294967296) .cse38)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse33 (+ .cse36 (* .cse26 .cse38) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37)) (.cse29 (+ (* .cse35 .cse38) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse25 (store (store .cse32 .cse33 v_prenex_1) .cse29 (- 1))) (.cse27 (store .cse32 .cse33 v_DerPreprocessor_11)) (.cse28 (+ .cse36 (* .cse34 .cse26) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (and (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26 4)) 0) (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26)) 0) (= .cse25 (store (store .cse27 .cse28 (select .cse25 .cse28)) .cse29 (- 1))) (= (select (store .cse27 .cse28 (- 1)) |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (let ((.cse31 (+ (* .cse34 .cse35) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse30 (store (store .cse32 .cse33 v_DerPreprocessor_7) .cse31 (- 1)))) (= (store (store .cse27 .cse28 (select .cse30 .cse28)) .cse31 (- 1)) .cse30)))))))))))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse58 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse60 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse58) 4)) (.cse61 (* .cse58 4))) (and (exists ((v_prenex_2 Int)) (let ((.cse45 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse44 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse45) 4)) (.cse43 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse42 (* .cse45 4))) (let ((.cse41 (+ .cse44 (* .cse42 .cse43) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4))) (let ((.cse40 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse41 v_prenex_2) (+ (* (+ (- 17179869184) .cse42) .cse43) .cse44 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4) (- 1)))) (and (= (select .cse40 .cse41) v_prenex_2) (= (select .cse40 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42)) 0))))))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse57 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse54 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse57) 4)) (.cse53 (* .cse57 4)) (.cse56 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse52 (+ (- 4294967296) .cse56)) (.cse50 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse51 (+ .cse54 (* .cse53 .cse56) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse46 (store .cse50 .cse51 v_DerPreprocessor_11)) (.cse47 (+ .cse54 (* .cse52 .cse53) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse55 (store .cse46 .cse47 (- 1)))) (and (let ((.cse49 (+ (* .cse52 (+ (- 17179869184) .cse53)) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse48 (store (store .cse50 .cse51 v_DerPreprocessor_7) .cse49 (- 1)))) (= (store (store .cse46 .cse47 (select .cse48 .cse47)) .cse49 (- 1)) .cse48))) (= (select .cse55 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse55 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0)))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (< (+ .cse58 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse58))) (= (select .cse59 (+ .cse60 (* |ULTIMATE.start_main_~index1~0#1| .cse61) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) 1) (= (select .cse59 (+ .cse60 (* .cse61 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) (- 1)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse71 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse68 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse69 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse71) 4)) (.cse70 (* .cse71 4))) (and (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_9 Int)) (let ((.cse67 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse66 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse67) 4)) (.cse65 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse64 (* .cse67 4))) (let ((.cse63 (+ .cse66 (* .cse64 .cse65) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64))) (let ((.cse62 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse63 v_DerPreprocessor_9) (+ (* (+ (- 17179869184) .cse64) .cse65) .cse66 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64) (- 1)))) (and (= v_DerPreprocessor_9 (select .cse62 .cse63)) (= (select .cse62 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64 4)) 0))))))) (= (select .cse68 (+ .cse69 (* |ULTIMATE.start_main_~index1~0#1| .cse70) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70)) 1) (= (- 1) (select .cse68 (+ .cse69 (* .cse70 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70))) (< .cse71 (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse71))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse83 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse80 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse83) 4)) (.cse79 (* .cse83 4)) (.cse82 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse78 (+ (- 4294967296) .cse82)) (.cse76 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse77 (+ .cse80 (* .cse79 .cse82) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse72 (store .cse76 .cse77 v_DerPreprocessor_11)) (.cse73 (+ .cse80 (* .cse78 .cse79) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse81 (store .cse72 .cse73 (- 1)))) (and (let ((.cse75 (+ (* .cse78 (+ (- 17179869184) .cse79)) .cse80 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse74 (store (store .cse76 .cse77 v_DerPreprocessor_7) .cse75 (- 1)))) (= (store (store .cse72 .cse73 (select .cse74 .cse73)) .cse75 (- 1)) .cse74))) (= (select .cse81 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse81 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))))))) (= (let ((.cse84 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse85 (* |c_ULTIMATE.start_main_~row~0#1| (* (mod c_~ARR_SIZE~0 4294967296) 4)))) (+ (select .cse84 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse85)) (select .cse84 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse85 4)))) |c_ULTIMATE.start_main_~sum~0#1|) (<= c_~ARR_SIZE~0 2) (= |c_ULTIMATE.start_main_~row~0#1| 0) (< 1 c_~ARR_SIZE~0) (<= |c_ULTIMATE.start_main_~column~0#1| 2) (= |c_ULTIMATE.start_main_~#array~0#1.offset| 0)) is different from false [2022-07-11 23:01:43,586 WARN L833 $PredicateComparison]: unable to prove that (and (or (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse4 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse1 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse4) 4)) (.cse2 (* .cse4 4)) (.cse3 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (- 1) (select .cse0 (+ .cse1 (* .cse2 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3))) (= (select .cse0 (+ .cse1 (* |ULTIMATE.start_main_~index1~0#1| .cse2) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3)) 1) (< (* |ULTIMATE.start_main_~index1~0#1| 4294967296) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse4))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse19 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse9 (* .cse19 4))) (let ((.cse15 (+ (- 17179869184) .cse9)) (.cse16 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse19) 4)) (.cse17 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse18 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse14 (+ (- 4294967296) .cse18)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse13 (+ .cse16 (* .cse9 .cse18) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17)) (.cse8 (+ (* .cse15 .cse18) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse7 (store (store .cse12 .cse13 v_prenex_1) .cse8 (- 1))) (.cse5 (store .cse12 .cse13 v_DerPreprocessor_11)) (.cse6 (+ .cse16 (* .cse14 .cse9) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (and (= (store (store .cse5 .cse6 (select .cse7 .cse6)) .cse8 (- 1)) .cse7) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9)) 0) (let ((.cse11 (+ (* .cse14 .cse15) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse10 (store (store .cse12 .cse13 v_DerPreprocessor_7) .cse11 (- 1)))) (= .cse10 (store (store .cse5 .cse6 (select .cse10 .cse6)) .cse11 (- 1))))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9 4)) 0) (= (select (store .cse5 .cse6 (- 1)) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0)))))))) (<= 0 |ULTIMATE.start_main_~index1~0#1|))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse24 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse21 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse24) 4)) (.cse22 (* .cse24 4)) (.cse23 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (select .cse20 (+ .cse21 (* |ULTIMATE.start_main_~index1~0#1| .cse22) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23)) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< (+ (* |ULTIMATE.start_main_~index1~0#1| 4294967296) 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse24))) (= (- 1) (select .cse20 (+ .cse21 (* .cse22 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse39 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse26 (* .cse39 4))) (let ((.cse35 (+ (- 17179869184) .cse26)) (.cse36 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse39) 4)) (.cse37 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse38 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse34 (+ (- 4294967296) .cse38)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse33 (+ .cse36 (* .cse26 .cse38) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37)) (.cse29 (+ (* .cse35 .cse38) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse25 (store (store .cse32 .cse33 v_prenex_1) .cse29 (- 1))) (.cse27 (store .cse32 .cse33 v_DerPreprocessor_11)) (.cse28 (+ .cse36 (* .cse34 .cse26) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (and (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26 4)) 0) (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26)) 0) (= .cse25 (store (store .cse27 .cse28 (select .cse25 .cse28)) .cse29 (- 1))) (= (select (store .cse27 .cse28 (- 1)) |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (let ((.cse31 (+ (* .cse34 .cse35) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse30 (store (store .cse32 .cse33 v_DerPreprocessor_7) .cse31 (- 1)))) (= (store (store .cse27 .cse28 (select .cse30 .cse28)) .cse31 (- 1)) .cse30)))))))))))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse58 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse60 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse58) 4)) (.cse61 (* .cse58 4))) (and (exists ((v_prenex_2 Int)) (let ((.cse45 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse44 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse45) 4)) (.cse43 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse42 (* .cse45 4))) (let ((.cse41 (+ .cse44 (* .cse42 .cse43) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4))) (let ((.cse40 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse41 v_prenex_2) (+ (* (+ (- 17179869184) .cse42) .cse43) .cse44 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4) (- 1)))) (and (= (select .cse40 .cse41) v_prenex_2) (= (select .cse40 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42)) 0))))))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse57 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse54 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse57) 4)) (.cse53 (* .cse57 4)) (.cse56 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse52 (+ (- 4294967296) .cse56)) (.cse50 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse51 (+ .cse54 (* .cse53 .cse56) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse46 (store .cse50 .cse51 v_DerPreprocessor_11)) (.cse47 (+ .cse54 (* .cse52 .cse53) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse55 (store .cse46 .cse47 (- 1)))) (and (let ((.cse49 (+ (* .cse52 (+ (- 17179869184) .cse53)) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse48 (store (store .cse50 .cse51 v_DerPreprocessor_7) .cse49 (- 1)))) (= (store (store .cse46 .cse47 (select .cse48 .cse47)) .cse49 (- 1)) .cse48))) (= (select .cse55 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse55 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0)))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (< (+ .cse58 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse58))) (= (select .cse59 (+ .cse60 (* |ULTIMATE.start_main_~index1~0#1| .cse61) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) 1) (= (select .cse59 (+ .cse60 (* .cse61 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) (- 1)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse71 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse68 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse69 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse71) 4)) (.cse70 (* .cse71 4))) (and (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_9 Int)) (let ((.cse67 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse66 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse67) 4)) (.cse65 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse64 (* .cse67 4))) (let ((.cse63 (+ .cse66 (* .cse64 .cse65) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64))) (let ((.cse62 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse63 v_DerPreprocessor_9) (+ (* (+ (- 17179869184) .cse64) .cse65) .cse66 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64) (- 1)))) (and (= v_DerPreprocessor_9 (select .cse62 .cse63)) (= (select .cse62 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64 4)) 0))))))) (= (select .cse68 (+ .cse69 (* |ULTIMATE.start_main_~index1~0#1| .cse70) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70)) 1) (= (- 1) (select .cse68 (+ .cse69 (* .cse70 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70))) (< .cse71 (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse71))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse83 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse80 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse83) 4)) (.cse79 (* .cse83 4)) (.cse82 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse78 (+ (- 4294967296) .cse82)) (.cse76 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse77 (+ .cse80 (* .cse79 .cse82) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse72 (store .cse76 .cse77 v_DerPreprocessor_11)) (.cse73 (+ .cse80 (* .cse78 .cse79) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse81 (store .cse72 .cse73 (- 1)))) (and (let ((.cse75 (+ (* .cse78 (+ (- 17179869184) .cse79)) .cse80 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse74 (store (store .cse76 .cse77 v_DerPreprocessor_7) .cse75 (- 1)))) (= (store (store .cse72 .cse73 (select .cse74 .cse73)) .cse75 (- 1)) .cse74))) (= (select .cse81 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse81 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))))))) (= (let ((.cse84 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse85 (* |c_ULTIMATE.start_main_~row~0#1| (* (mod c_~ARR_SIZE~0 4294967296) 4)))) (+ (select .cse84 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse85)) (select .cse84 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse85 4)))) |c_ULTIMATE.start_main_~sum~0#1|) (<= c_~ARR_SIZE~0 2) (= |c_ULTIMATE.start_main_~row~0#1| 0) (< 1 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~#array~0#1.offset| 0)) is different from false [2022-07-11 23:01:54,756 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse84 (+ (- 1) |c_ULTIMATE.start_main_~row~0#1|))) (and (or (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse4 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse1 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse4) 4)) (.cse2 (* .cse4 4)) (.cse3 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (- 1) (select .cse0 (+ .cse1 (* .cse2 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3))) (= (select .cse0 (+ .cse1 (* |ULTIMATE.start_main_~index1~0#1| .cse2) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3)) 1) (< (* |ULTIMATE.start_main_~index1~0#1| 4294967296) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse4))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse19 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse9 (* .cse19 4))) (let ((.cse15 (+ (- 17179869184) .cse9)) (.cse16 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse19) 4)) (.cse17 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse18 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse14 (+ (- 4294967296) .cse18)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse13 (+ .cse16 (* .cse9 .cse18) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17)) (.cse8 (+ (* .cse15 .cse18) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse7 (store (store .cse12 .cse13 v_prenex_1) .cse8 (- 1))) (.cse5 (store .cse12 .cse13 v_DerPreprocessor_11)) (.cse6 (+ .cse16 (* .cse14 .cse9) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (and (= (store (store .cse5 .cse6 (select .cse7 .cse6)) .cse8 (- 1)) .cse7) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9)) 0) (let ((.cse11 (+ (* .cse14 .cse15) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse10 (store (store .cse12 .cse13 v_DerPreprocessor_7) .cse11 (- 1)))) (= .cse10 (store (store .cse5 .cse6 (select .cse10 .cse6)) .cse11 (- 1))))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9 4)) 0) (= (select (store .cse5 .cse6 (- 1)) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0)))))))) (<= 0 |ULTIMATE.start_main_~index1~0#1|))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse24 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse21 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse24) 4)) (.cse22 (* .cse24 4)) (.cse23 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (select .cse20 (+ .cse21 (* |ULTIMATE.start_main_~index1~0#1| .cse22) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23)) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< (+ (* |ULTIMATE.start_main_~index1~0#1| 4294967296) 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse24))) (= (- 1) (select .cse20 (+ .cse21 (* .cse22 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse39 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse26 (* .cse39 4))) (let ((.cse35 (+ (- 17179869184) .cse26)) (.cse36 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse39) 4)) (.cse37 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse38 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse34 (+ (- 4294967296) .cse38)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse33 (+ .cse36 (* .cse26 .cse38) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37)) (.cse29 (+ (* .cse35 .cse38) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse25 (store (store .cse32 .cse33 v_prenex_1) .cse29 (- 1))) (.cse27 (store .cse32 .cse33 v_DerPreprocessor_11)) (.cse28 (+ .cse36 (* .cse34 .cse26) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (and (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26 4)) 0) (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26)) 0) (= .cse25 (store (store .cse27 .cse28 (select .cse25 .cse28)) .cse29 (- 1))) (= (select (store .cse27 .cse28 (- 1)) |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (let ((.cse31 (+ (* .cse34 .cse35) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse30 (store (store .cse32 .cse33 v_DerPreprocessor_7) .cse31 (- 1)))) (= (store (store .cse27 .cse28 (select .cse30 .cse28)) .cse31 (- 1)) .cse30)))))))))))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse58 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse60 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse58) 4)) (.cse61 (* .cse58 4))) (and (exists ((v_prenex_2 Int)) (let ((.cse45 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse44 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse45) 4)) (.cse43 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse42 (* .cse45 4))) (let ((.cse41 (+ .cse44 (* .cse42 .cse43) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4))) (let ((.cse40 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse41 v_prenex_2) (+ (* (+ (- 17179869184) .cse42) .cse43) .cse44 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4) (- 1)))) (and (= (select .cse40 .cse41) v_prenex_2) (= (select .cse40 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42)) 0))))))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse57 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse54 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse57) 4)) (.cse53 (* .cse57 4)) (.cse56 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse52 (+ (- 4294967296) .cse56)) (.cse50 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse51 (+ .cse54 (* .cse53 .cse56) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse46 (store .cse50 .cse51 v_DerPreprocessor_11)) (.cse47 (+ .cse54 (* .cse52 .cse53) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse55 (store .cse46 .cse47 (- 1)))) (and (let ((.cse49 (+ (* .cse52 (+ (- 17179869184) .cse53)) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse48 (store (store .cse50 .cse51 v_DerPreprocessor_7) .cse49 (- 1)))) (= (store (store .cse46 .cse47 (select .cse48 .cse47)) .cse49 (- 1)) .cse48))) (= (select .cse55 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse55 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0)))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (< (+ .cse58 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse58))) (= (select .cse59 (+ .cse60 (* |ULTIMATE.start_main_~index1~0#1| .cse61) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) 1) (= (select .cse59 (+ .cse60 (* .cse61 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) (- 1)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse71 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse68 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse69 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse71) 4)) (.cse70 (* .cse71 4))) (and (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_9 Int)) (let ((.cse67 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse66 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse67) 4)) (.cse65 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse64 (* .cse67 4))) (let ((.cse63 (+ .cse66 (* .cse64 .cse65) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64))) (let ((.cse62 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse63 v_DerPreprocessor_9) (+ (* (+ (- 17179869184) .cse64) .cse65) .cse66 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64) (- 1)))) (and (= v_DerPreprocessor_9 (select .cse62 .cse63)) (= (select .cse62 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64 4)) 0))))))) (= (select .cse68 (+ .cse69 (* |ULTIMATE.start_main_~index1~0#1| .cse70) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70)) 1) (= (- 1) (select .cse68 (+ .cse69 (* .cse70 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70))) (< .cse71 (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse71))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse83 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse80 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse83) 4)) (.cse79 (* .cse83 4)) (.cse82 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse78 (+ (- 4294967296) .cse82)) (.cse76 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse77 (+ .cse80 (* .cse79 .cse82) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse72 (store .cse76 .cse77 v_DerPreprocessor_11)) (.cse73 (+ .cse80 (* .cse78 .cse79) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse81 (store .cse72 .cse73 (- 1)))) (and (let ((.cse75 (+ (* .cse78 (+ (- 17179869184) .cse79)) .cse80 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse74 (store (store .cse76 .cse77 v_DerPreprocessor_7) .cse75 (- 1)))) (= (store (store .cse72 .cse73 (select .cse74 .cse73)) .cse75 (- 1)) .cse74))) (= (select .cse81 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse81 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))))))) (= .cse84 0) (<= c_~ARR_SIZE~0 2) (= (let ((.cse85 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse86 (* .cse84 (* (mod c_~ARR_SIZE~0 4294967296) 4)))) (+ (select .cse85 (+ .cse86 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (select .cse85 (+ .cse86 |c_ULTIMATE.start_main_~#array~0#1.offset| 4)))) |c_ULTIMATE.start_main_~sum~0#1|) (< 1 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~#array~0#1.offset| 0))) is different from false [2022-07-11 23:02:01,748 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse84 (+ (- 1) |c_ULTIMATE.start_main_~row~0#1|))) (and (or (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse4 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse1 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse4) 4)) (.cse2 (* .cse4 4)) (.cse3 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (- 1) (select .cse0 (+ .cse1 (* .cse2 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3))) (= (select .cse0 (+ .cse1 (* |ULTIMATE.start_main_~index1~0#1| .cse2) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3)) 1) (< (* |ULTIMATE.start_main_~index1~0#1| 4294967296) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse4))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse19 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse9 (* .cse19 4))) (let ((.cse15 (+ (- 17179869184) .cse9)) (.cse16 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse19) 4)) (.cse17 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse18 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse14 (+ (- 4294967296) .cse18)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse13 (+ .cse16 (* .cse9 .cse18) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17)) (.cse8 (+ (* .cse15 .cse18) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse7 (store (store .cse12 .cse13 v_prenex_1) .cse8 (- 1))) (.cse5 (store .cse12 .cse13 v_DerPreprocessor_11)) (.cse6 (+ .cse16 (* .cse14 .cse9) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (and (= (store (store .cse5 .cse6 (select .cse7 .cse6)) .cse8 (- 1)) .cse7) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9)) 0) (let ((.cse11 (+ (* .cse14 .cse15) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse10 (store (store .cse12 .cse13 v_DerPreprocessor_7) .cse11 (- 1)))) (= .cse10 (store (store .cse5 .cse6 (select .cse10 .cse6)) .cse11 (- 1))))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9 4)) 0) (= (select (store .cse5 .cse6 (- 1)) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0)))))))) (<= 0 |ULTIMATE.start_main_~index1~0#1|))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse24 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse21 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse24) 4)) (.cse22 (* .cse24 4)) (.cse23 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (select .cse20 (+ .cse21 (* |ULTIMATE.start_main_~index1~0#1| .cse22) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23)) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< (+ (* |ULTIMATE.start_main_~index1~0#1| 4294967296) 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse24))) (= (- 1) (select .cse20 (+ .cse21 (* .cse22 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse39 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse26 (* .cse39 4))) (let ((.cse35 (+ (- 17179869184) .cse26)) (.cse36 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse39) 4)) (.cse37 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse38 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse34 (+ (- 4294967296) .cse38)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse33 (+ .cse36 (* .cse26 .cse38) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37)) (.cse29 (+ (* .cse35 .cse38) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse25 (store (store .cse32 .cse33 v_prenex_1) .cse29 (- 1))) (.cse27 (store .cse32 .cse33 v_DerPreprocessor_11)) (.cse28 (+ .cse36 (* .cse34 .cse26) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (and (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26 4)) 0) (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26)) 0) (= .cse25 (store (store .cse27 .cse28 (select .cse25 .cse28)) .cse29 (- 1))) (= (select (store .cse27 .cse28 (- 1)) |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (let ((.cse31 (+ (* .cse34 .cse35) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse30 (store (store .cse32 .cse33 v_DerPreprocessor_7) .cse31 (- 1)))) (= (store (store .cse27 .cse28 (select .cse30 .cse28)) .cse31 (- 1)) .cse30)))))))))))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse58 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse60 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse58) 4)) (.cse61 (* .cse58 4))) (and (exists ((v_prenex_2 Int)) (let ((.cse45 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse44 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse45) 4)) (.cse43 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse42 (* .cse45 4))) (let ((.cse41 (+ .cse44 (* .cse42 .cse43) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4))) (let ((.cse40 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse41 v_prenex_2) (+ (* (+ (- 17179869184) .cse42) .cse43) .cse44 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4) (- 1)))) (and (= (select .cse40 .cse41) v_prenex_2) (= (select .cse40 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42)) 0))))))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse57 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse54 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse57) 4)) (.cse53 (* .cse57 4)) (.cse56 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse52 (+ (- 4294967296) .cse56)) (.cse50 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse51 (+ .cse54 (* .cse53 .cse56) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse46 (store .cse50 .cse51 v_DerPreprocessor_11)) (.cse47 (+ .cse54 (* .cse52 .cse53) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse55 (store .cse46 .cse47 (- 1)))) (and (let ((.cse49 (+ (* .cse52 (+ (- 17179869184) .cse53)) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse48 (store (store .cse50 .cse51 v_DerPreprocessor_7) .cse49 (- 1)))) (= (store (store .cse46 .cse47 (select .cse48 .cse47)) .cse49 (- 1)) .cse48))) (= (select .cse55 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse55 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0)))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (< (+ .cse58 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse58))) (= (select .cse59 (+ .cse60 (* |ULTIMATE.start_main_~index1~0#1| .cse61) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) 1) (= (select .cse59 (+ .cse60 (* .cse61 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) (- 1)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse71 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse68 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse69 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse71) 4)) (.cse70 (* .cse71 4))) (and (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_9 Int)) (let ((.cse67 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse66 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse67) 4)) (.cse65 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse64 (* .cse67 4))) (let ((.cse63 (+ .cse66 (* .cse64 .cse65) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64))) (let ((.cse62 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse63 v_DerPreprocessor_9) (+ (* (+ (- 17179869184) .cse64) .cse65) .cse66 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64) (- 1)))) (and (= v_DerPreprocessor_9 (select .cse62 .cse63)) (= (select .cse62 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64 4)) 0))))))) (= (select .cse68 (+ .cse69 (* |ULTIMATE.start_main_~index1~0#1| .cse70) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70)) 1) (= (- 1) (select .cse68 (+ .cse69 (* .cse70 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70))) (< .cse71 (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse71))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse83 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse80 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse83) 4)) (.cse79 (* .cse83 4)) (.cse82 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse78 (+ (- 4294967296) .cse82)) (.cse76 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse77 (+ .cse80 (* .cse79 .cse82) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse72 (store .cse76 .cse77 v_DerPreprocessor_11)) (.cse73 (+ .cse80 (* .cse78 .cse79) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse81 (store .cse72 .cse73 (- 1)))) (and (let ((.cse75 (+ (* .cse78 (+ (- 17179869184) .cse79)) .cse80 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse74 (store (store .cse76 .cse77 v_DerPreprocessor_7) .cse75 (- 1)))) (= (store (store .cse72 .cse73 (select .cse74 .cse73)) .cse75 (- 1)) .cse74))) (= (select .cse81 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse81 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))))))) (= .cse84 0) (<= c_~ARR_SIZE~0 2) (= (let ((.cse85 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse86 (* .cse84 (* (mod c_~ARR_SIZE~0 4294967296) 4)))) (+ (select .cse85 (+ .cse86 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (select .cse85 (+ .cse86 |c_ULTIMATE.start_main_~#array~0#1.offset| 4)))) |c_ULTIMATE.start_main_~sum~0#1|) (< 1 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~#array~0#1.offset| 0) (= |c_ULTIMATE.start_main_~column~0#1| 0))) is different from false [2022-07-11 23:02:08,673 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse84 (+ (- 1) |c_ULTIMATE.start_main_~row~0#1|))) (and (or (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse4 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse1 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse4) 4)) (.cse2 (* .cse4 4)) (.cse3 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (- 1) (select .cse0 (+ .cse1 (* .cse2 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3))) (= (select .cse0 (+ .cse1 (* |ULTIMATE.start_main_~index1~0#1| .cse2) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3)) 1) (< (* |ULTIMATE.start_main_~index1~0#1| 4294967296) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse4))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse19 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse9 (* .cse19 4))) (let ((.cse15 (+ (- 17179869184) .cse9)) (.cse16 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse19) 4)) (.cse17 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse18 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse14 (+ (- 4294967296) .cse18)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse13 (+ .cse16 (* .cse9 .cse18) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17)) (.cse8 (+ (* .cse15 .cse18) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse7 (store (store .cse12 .cse13 v_prenex_1) .cse8 (- 1))) (.cse5 (store .cse12 .cse13 v_DerPreprocessor_11)) (.cse6 (+ .cse16 (* .cse14 .cse9) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (and (= (store (store .cse5 .cse6 (select .cse7 .cse6)) .cse8 (- 1)) .cse7) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9)) 0) (let ((.cse11 (+ (* .cse14 .cse15) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse10 (store (store .cse12 .cse13 v_DerPreprocessor_7) .cse11 (- 1)))) (= .cse10 (store (store .cse5 .cse6 (select .cse10 .cse6)) .cse11 (- 1))))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9 4)) 0) (= (select (store .cse5 .cse6 (- 1)) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0)))))))) (<= 0 |ULTIMATE.start_main_~index1~0#1|))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse24 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse21 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse24) 4)) (.cse22 (* .cse24 4)) (.cse23 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (select .cse20 (+ .cse21 (* |ULTIMATE.start_main_~index1~0#1| .cse22) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23)) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< (+ (* |ULTIMATE.start_main_~index1~0#1| 4294967296) 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse24))) (= (- 1) (select .cse20 (+ .cse21 (* .cse22 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse39 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse26 (* .cse39 4))) (let ((.cse35 (+ (- 17179869184) .cse26)) (.cse36 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse39) 4)) (.cse37 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse38 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse34 (+ (- 4294967296) .cse38)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse33 (+ .cse36 (* .cse26 .cse38) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37)) (.cse29 (+ (* .cse35 .cse38) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse25 (store (store .cse32 .cse33 v_prenex_1) .cse29 (- 1))) (.cse27 (store .cse32 .cse33 v_DerPreprocessor_11)) (.cse28 (+ .cse36 (* .cse34 .cse26) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (and (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26 4)) 0) (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26)) 0) (= .cse25 (store (store .cse27 .cse28 (select .cse25 .cse28)) .cse29 (- 1))) (= (select (store .cse27 .cse28 (- 1)) |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (let ((.cse31 (+ (* .cse34 .cse35) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse30 (store (store .cse32 .cse33 v_DerPreprocessor_7) .cse31 (- 1)))) (= (store (store .cse27 .cse28 (select .cse30 .cse28)) .cse31 (- 1)) .cse30)))))))))))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse58 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse60 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse58) 4)) (.cse61 (* .cse58 4))) (and (exists ((v_prenex_2 Int)) (let ((.cse45 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse44 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse45) 4)) (.cse43 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse42 (* .cse45 4))) (let ((.cse41 (+ .cse44 (* .cse42 .cse43) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4))) (let ((.cse40 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse41 v_prenex_2) (+ (* (+ (- 17179869184) .cse42) .cse43) .cse44 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4) (- 1)))) (and (= (select .cse40 .cse41) v_prenex_2) (= (select .cse40 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42)) 0))))))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse57 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse54 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse57) 4)) (.cse53 (* .cse57 4)) (.cse56 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse52 (+ (- 4294967296) .cse56)) (.cse50 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse51 (+ .cse54 (* .cse53 .cse56) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse46 (store .cse50 .cse51 v_DerPreprocessor_11)) (.cse47 (+ .cse54 (* .cse52 .cse53) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse55 (store .cse46 .cse47 (- 1)))) (and (let ((.cse49 (+ (* .cse52 (+ (- 17179869184) .cse53)) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse48 (store (store .cse50 .cse51 v_DerPreprocessor_7) .cse49 (- 1)))) (= (store (store .cse46 .cse47 (select .cse48 .cse47)) .cse49 (- 1)) .cse48))) (= (select .cse55 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse55 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0)))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (< (+ .cse58 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse58))) (= (select .cse59 (+ .cse60 (* |ULTIMATE.start_main_~index1~0#1| .cse61) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) 1) (= (select .cse59 (+ .cse60 (* .cse61 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) (- 1)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse71 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse68 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse69 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse71) 4)) (.cse70 (* .cse71 4))) (and (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_9 Int)) (let ((.cse67 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse66 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse67) 4)) (.cse65 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse64 (* .cse67 4))) (let ((.cse63 (+ .cse66 (* .cse64 .cse65) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64))) (let ((.cse62 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse63 v_DerPreprocessor_9) (+ (* (+ (- 17179869184) .cse64) .cse65) .cse66 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64) (- 1)))) (and (= v_DerPreprocessor_9 (select .cse62 .cse63)) (= (select .cse62 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64 4)) 0))))))) (= (select .cse68 (+ .cse69 (* |ULTIMATE.start_main_~index1~0#1| .cse70) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70)) 1) (= (- 1) (select .cse68 (+ .cse69 (* .cse70 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70))) (< .cse71 (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse71))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse83 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse80 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse83) 4)) (.cse79 (* .cse83 4)) (.cse82 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse78 (+ (- 4294967296) .cse82)) (.cse76 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse77 (+ .cse80 (* .cse79 .cse82) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse72 (store .cse76 .cse77 v_DerPreprocessor_11)) (.cse73 (+ .cse80 (* .cse78 .cse79) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse81 (store .cse72 .cse73 (- 1)))) (and (let ((.cse75 (+ (* .cse78 (+ (- 17179869184) .cse79)) .cse80 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse74 (store (store .cse76 .cse77 v_DerPreprocessor_7) .cse75 (- 1)))) (= (store (store .cse72 .cse73 (select .cse74 .cse73)) .cse75 (- 1)) .cse74))) (= (select .cse81 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse81 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))))))) (= .cse84 0) (<= c_~ARR_SIZE~0 2) (< 1 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~#array~0#1.offset| 0) (= |c_ULTIMATE.start_main_~sum~0#1| (let ((.cse86 (* (mod c_~ARR_SIZE~0 4294967296) 4))) (let ((.cse85 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse87 (* .cse84 .cse86))) (+ (select .cse85 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| (* |c_ULTIMATE.start_main_~row~0#1| .cse86) (* |c_ULTIMATE.start_main_~column~0#1| 4))) (select .cse85 (+ .cse87 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (select .cse85 (+ .cse87 |c_ULTIMATE.start_main_~#array~0#1.offset| 4)))))) (= |c_ULTIMATE.start_main_~column~0#1| 0))) is different from false [2022-07-11 23:02:17,152 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse84 (+ (- 1) |c_ULTIMATE.start_main_~row~0#1|))) (and (or (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse4 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse1 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse4) 4)) (.cse2 (* .cse4 4)) (.cse3 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (- 1) (select .cse0 (+ .cse1 (* .cse2 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3))) (= (select .cse0 (+ .cse1 (* |ULTIMATE.start_main_~index1~0#1| .cse2) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3)) 1) (< (* |ULTIMATE.start_main_~index1~0#1| 4294967296) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse4))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse19 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse9 (* .cse19 4))) (let ((.cse15 (+ (- 17179869184) .cse9)) (.cse16 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse19) 4)) (.cse17 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse18 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse14 (+ (- 4294967296) .cse18)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse13 (+ .cse16 (* .cse9 .cse18) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17)) (.cse8 (+ (* .cse15 .cse18) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse7 (store (store .cse12 .cse13 v_prenex_1) .cse8 (- 1))) (.cse5 (store .cse12 .cse13 v_DerPreprocessor_11)) (.cse6 (+ .cse16 (* .cse14 .cse9) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (and (= (store (store .cse5 .cse6 (select .cse7 .cse6)) .cse8 (- 1)) .cse7) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9)) 0) (let ((.cse11 (+ (* .cse14 .cse15) .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse17))) (let ((.cse10 (store (store .cse12 .cse13 v_DerPreprocessor_7) .cse11 (- 1)))) (= .cse10 (store (store .cse5 .cse6 (select .cse10 .cse6)) .cse11 (- 1))))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9 4)) 0) (= (select (store .cse5 .cse6 (- 1)) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0)))))))) (<= 0 |ULTIMATE.start_main_~index1~0#1|))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse24 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse21 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse24) 4)) (.cse22 (* .cse24 4)) (.cse23 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) (and (= (select .cse20 (+ .cse21 (* |ULTIMATE.start_main_~index1~0#1| .cse22) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23)) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< (+ (* |ULTIMATE.start_main_~index1~0#1| 4294967296) 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse24))) (= (- 1) (select .cse20 (+ .cse21 (* .cse22 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse23))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse39 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse26 (* .cse39 4))) (let ((.cse35 (+ (- 17179869184) .cse26)) (.cse36 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse39) 4)) (.cse37 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|)) (.cse38 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse34 (+ (- 4294967296) .cse38)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse33 (+ .cse36 (* .cse26 .cse38) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37)) (.cse29 (+ (* .cse35 .cse38) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse25 (store (store .cse32 .cse33 v_prenex_1) .cse29 (- 1))) (.cse27 (store .cse32 .cse33 v_DerPreprocessor_11)) (.cse28 (+ .cse36 (* .cse34 .cse26) |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (and (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26 4)) 0) (= (select .cse25 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse26)) 0) (= .cse25 (store (store .cse27 .cse28 (select .cse25 .cse28)) .cse29 (- 1))) (= (select (store .cse27 .cse28 (- 1)) |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (let ((.cse31 (+ (* .cse34 .cse35) .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse37))) (let ((.cse30 (store (store .cse32 .cse33 v_DerPreprocessor_7) .cse31 (- 1)))) (= (store (store .cse27 .cse28 (select .cse30 .cse28)) .cse31 (- 1)) .cse30)))))))))))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse58 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse60 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse58) 4)) (.cse61 (* .cse58 4))) (and (exists ((v_prenex_2 Int)) (let ((.cse45 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse44 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse45) 4)) (.cse43 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse42 (* .cse45 4))) (let ((.cse41 (+ .cse44 (* .cse42 .cse43) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4))) (let ((.cse40 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse41 v_prenex_2) (+ (* (+ (- 17179869184) .cse42) .cse43) .cse44 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42 4) (- 1)))) (and (= (select .cse40 .cse41) v_prenex_2) (= (select .cse40 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42)) 0))))))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse57 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse54 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse57) 4)) (.cse53 (* .cse57 4)) (.cse56 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse52 (+ (- 4294967296) .cse56)) (.cse50 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse51 (+ .cse54 (* .cse53 .cse56) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse46 (store .cse50 .cse51 v_DerPreprocessor_11)) (.cse47 (+ .cse54 (* .cse52 .cse53) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse55 (store .cse46 .cse47 (- 1)))) (and (let ((.cse49 (+ (* .cse52 (+ (- 17179869184) .cse53)) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53 4))) (let ((.cse48 (store (store .cse50 .cse51 v_DerPreprocessor_7) .cse49 (- 1)))) (= (store (store .cse46 .cse47 (select .cse48 .cse47)) .cse49 (- 1)) .cse48))) (= (select .cse55 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse55 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0)))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (< (+ .cse58 1) (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse58))) (= (select .cse59 (+ .cse60 (* |ULTIMATE.start_main_~index1~0#1| .cse61) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) 1) (= (select .cse59 (+ .cse60 (* .cse61 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse61 4)) (- 1)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse71 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse68 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse69 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse71) 4)) (.cse70 (* .cse71 4))) (and (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_9 Int)) (let ((.cse67 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse66 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse67) 4)) (.cse65 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) (.cse64 (* .cse67 4))) (let ((.cse63 (+ .cse66 (* .cse64 .cse65) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64))) (let ((.cse62 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) .cse63 v_DerPreprocessor_9) (+ (* (+ (- 17179869184) .cse64) .cse65) .cse66 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64) (- 1)))) (and (= v_DerPreprocessor_9 (select .cse62 .cse63)) (= (select .cse62 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse64 4)) 0))))))) (= (select .cse68 (+ .cse69 (* |ULTIMATE.start_main_~index1~0#1| .cse70) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70)) 1) (= (- 1) (select .cse68 (+ .cse69 (* .cse70 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse70))) (< .cse71 (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse71))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_7 Int)) (let ((.cse83 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse80 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse83) 4)) (.cse79 (* .cse83 4)) (.cse82 (mod (+ c_~ARR_SIZE~0 4294967295 (* |ULTIMATE.start_main_~index1~0#1| 4294967295)) 4294967296))) (let ((.cse78 (+ (- 4294967296) .cse82)) (.cse76 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse77 (+ .cse80 (* .cse79 .cse82) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse72 (store .cse76 .cse77 v_DerPreprocessor_11)) (.cse73 (+ .cse80 (* .cse78 .cse79) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse81 (store .cse72 .cse73 (- 1)))) (and (let ((.cse75 (+ (* .cse78 (+ (- 17179869184) .cse79)) .cse80 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse79))) (let ((.cse74 (store (store .cse76 .cse77 v_DerPreprocessor_7) .cse75 (- 1)))) (= (store (store .cse72 .cse73 (select .cse74 .cse73)) .cse75 (- 1)) .cse74))) (= (select .cse81 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse81 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))))))) (= .cse84 0) (<= c_~ARR_SIZE~0 2) (< 1 c_~ARR_SIZE~0) (= (+ (- 1) |c_ULTIMATE.start_main_~column~0#1|) 0) (= |c_ULTIMATE.start_main_~sum~0#1| (let ((.cse87 (* (mod c_~ARR_SIZE~0 4294967296) 4))) (let ((.cse85 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse86 (* .cse84 .cse87))) (+ (select .cse85 (+ .cse86 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (select .cse85 (+ (- 4) |c_ULTIMATE.start_main_~#array~0#1.offset| (* |c_ULTIMATE.start_main_~row~0#1| .cse87) (* |c_ULTIMATE.start_main_~column~0#1| 4))) (select .cse85 (+ .cse86 |c_ULTIMATE.start_main_~#array~0#1.offset| 4)))))) (= |c_ULTIMATE.start_main_~#array~0#1.offset| 0))) is different from false [2022-07-11 23:02:17,214 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 3019 treesize of output 2923 [2022-07-11 23:02:21,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:02:21,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:02:21,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:02:21,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:02:21,250 INFO L173 IndexEqualityManager]: detected equality via solver