./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array13_pattern.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/array13_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 78699f7813351c3df7f7fcab3bf98fffd7a92c5cc679034a9d139e9169232d7e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:22:46,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:22:46,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:22:46,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:22:46,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:22:46,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:22:46,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:22:46,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:22:46,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:22:46,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:22:46,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:22:46,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:22:46,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:22:46,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:22:46,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:22:46,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:22:46,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:22:46,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:22:46,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:22:46,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:22:46,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:22:46,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:22:46,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:22:46,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:22:46,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:22:46,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:22:46,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:22:46,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:22:46,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:22:46,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:22:46,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:22:46,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:22:46,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:22:46,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:22:46,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:22:46,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:22:46,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:22:46,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:22:46,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:22:46,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:22:46,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:22:46,840 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:22:46,872 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:22:46,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:22:46,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:22:46,873 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:22:46,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:22:46,874 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:22:46,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:22:46,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:22:46,875 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:22:46,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:22:46,876 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:22:46,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:22:46,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:22:46,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:22:46,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:22:46,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:22:46,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:22:46,877 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:22:46,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:22:46,877 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:22:46,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:22:46,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:22:46,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:22:46,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:22:46,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:46,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:22:46,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:22:46,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:22:46,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:22:46,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:22:46,880 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:22:46,880 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:22:46,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:22:46,880 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 -> 78699f7813351c3df7f7fcab3bf98fffd7a92c5cc679034a9d139e9169232d7e [2022-02-20 14:22:47,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:22:47,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:22:47,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:22:47,152 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:22:47,152 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:22:47,154 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array13_pattern.c [2022-02-20 14:22:47,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb541dfe5/2d9959784def4dff921389267f5d0797/FLAGd45d0639e [2022-02-20 14:22:47,582 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:22:47,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array13_pattern.c [2022-02-20 14:22:47,591 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb541dfe5/2d9959784def4dff921389267f5d0797/FLAGd45d0639e [2022-02-20 14:22:47,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb541dfe5/2d9959784def4dff921389267f5d0797 [2022-02-20 14:22:47,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:22:47,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:22:47,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:47,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:22:47,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:22:47,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:47" (1/1) ... [2022-02-20 14:22:47,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f86f351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:47, skipping insertion in model container [2022-02-20 14:22:47,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:47" (1/1) ... [2022-02-20 14:22:47,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:22:47,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:22:47,762 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/array13_pattern.c[1342,1355] [2022-02-20 14:22:47,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:47,800 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:22:47,809 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/array13_pattern.c[1342,1355] [2022-02-20 14:22:47,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:47,842 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:22:47,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:47 WrapperNode [2022-02-20 14:22:47,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:47,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:47,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:22:47,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:22:47,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:47" (1/1) ... [2022-02-20 14:22:47,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:47" (1/1) ... [2022-02-20 14:22:47,894 INFO L137 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2022-02-20 14:22:47,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:47,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:22:47,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:22:47,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:22:47,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:47" (1/1) ... [2022-02-20 14:22:47,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:47" (1/1) ... [2022-02-20 14:22:47,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:47" (1/1) ... [2022-02-20 14:22:47,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:47" (1/1) ... [2022-02-20 14:22:47,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:47" (1/1) ... [2022-02-20 14:22:47,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:47" (1/1) ... [2022-02-20 14:22:47,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:47" (1/1) ... [2022-02-20 14:22:47,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:22:47,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:22:47,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:22:47,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:22:47,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:47" (1/1) ... [2022-02-20 14:22:47,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:47,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:47,981 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-02-20 14:22:48,009 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-02-20 14:22:48,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:22:48,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:22:48,033 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:22:48,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:22:48,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:22:48,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:22:48,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:22:48,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:22:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:22:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:22:48,084 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:22:48,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:22:48,334 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:22:48,338 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:22:48,339 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 14:22:48,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:22:48 BoogieIcfgContainer [2022-02-20 14:22:48,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:22:48,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:22:48,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:22:48,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:22:48,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:22:47" (1/3) ... [2022-02-20 14:22:48,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330b615b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:22:48, skipping insertion in model container [2022-02-20 14:22:48,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:47" (2/3) ... [2022-02-20 14:22:48,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330b615b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:22:48, skipping insertion in model container [2022-02-20 14:22:48,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:22:48" (3/3) ... [2022-02-20 14:22:48,355 INFO L111 eAbstractionObserver]: Analyzing ICFG array13_pattern.c [2022-02-20 14:22:48,358 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:22:48,358 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:22:48,396 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:22:48,402 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:22:48,403 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:22:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:22:48,424 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:48,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:48,425 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:48,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:48,429 INFO L85 PathProgramCache]: Analyzing trace with hash -152131175, now seen corresponding path program 1 times [2022-02-20 14:22:48,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:48,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21902116] [2022-02-20 14:22:48,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:48,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:22:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:48,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-02-20 14:22:48,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-02-20 14:22:48,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-02-20 14:22:48,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #104#return; {35#false} is VALID [2022-02-20 14:22:48,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {34#true} is VALID [2022-02-20 14:22:48,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {34#true} is VALID [2022-02-20 14:22:48,627 INFO L272 TraceCheckUtils]: 2: Hoare triple {34#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {34#true} is VALID [2022-02-20 14:22:48,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-02-20 14:22:48,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-02-20 14:22:48,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#false} assume true; {35#false} is VALID [2022-02-20 14:22:48,628 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {35#false} {34#true} #104#return; {35#false} is VALID [2022-02-20 14:22:48,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {35#false} is VALID [2022-02-20 14:22:48,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {35#false} is VALID [2022-02-20 14:22:48,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume false; {35#false} is VALID [2022-02-20 14:22:48,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} main_~row~0#1 := 0; {35#false} is VALID [2022-02-20 14:22:48,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {35#false} is VALID [2022-02-20 14:22:48,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {35#false} is VALID [2022-02-20 14:22:48,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#false} assume 0 == __VERIFIER_assert_~cond#1; {35#false} is VALID [2022-02-20 14:22:48,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-02-20 14:22:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:22:48,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:48,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21902116] [2022-02-20 14:22:48,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21902116] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:48,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:48,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:22:48,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766772183] [2022-02-20 14:22:48,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:48,639 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-02-20 14:22:48,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:48,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 14:22:48,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:48,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:22:48,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:22:48,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:22:48,689 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 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-02-20 14:22:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:48,751 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2022-02-20 14:22:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:22:48,751 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-02-20 14:22:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:22:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2022-02-20 14:22:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:22:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2022-02-20 14:22:48,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 91 transitions. [2022-02-20 14:22:48,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:48,870 INFO L225 Difference]: With dead ends: 59 [2022-02-20 14:22:48,871 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 14:22:48,873 INFO L932 BasicCegarLoop]: 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-02-20 14:22:48,876 INFO L933 BasicCegarLoop]: 38 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, 38 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-02-20 14:22:48,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:22:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 14:22:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 14:22:48,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:48,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:48,901 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:48,901 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:48,905 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 14:22:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 14:22:48,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:48,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:48,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-02-20 14:22:48,907 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-02-20 14:22:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:48,911 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 14:22:48,912 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 14:22:48,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:48,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:48,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:48,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-02-20 14:22:48,920 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 15 [2022-02-20 14:22:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:48,920 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-02-20 14:22:48,921 INFO L471 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-02-20 14:22:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 14:22:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:22:48,923 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:48,926 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:48,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:22:48,927 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2136147464, now seen corresponding path program 1 times [2022-02-20 14:22:48,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:48,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164483098] [2022-02-20 14:22:48,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:48,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:48,972 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:48,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [556857786] [2022-02-20 14:22:48,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:48,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:48,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:48,979 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-02-20 14:22:48,980 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-02-20 14:22:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:49,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:22:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:49,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:49,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {207#true} is VALID [2022-02-20 14:22:49,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {207#true} is VALID [2022-02-20 14:22:49,282 INFO L272 TraceCheckUtils]: 2: Hoare triple {207#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {207#true} is VALID [2022-02-20 14:22:49,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {207#true} ~cond := #in~cond; {221#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 14:22:49,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {221#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {225#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:22:49,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {225#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:22:49,285 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {225#(not (= |assume_abort_if_not_#in~cond| 0))} {207#true} #104#return; {232#(< 0 ~ARR_SIZE~0)} is VALID [2022-02-20 14:22:49,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(< 0 ~ARR_SIZE~0)} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {236#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 0))} is VALID [2022-02-20 14:22:49,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {236#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 0))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {208#false} is VALID [2022-02-20 14:22:49,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {208#false} is VALID [2022-02-20 14:22:49,288 INFO L272 TraceCheckUtils]: 10: Hoare triple {208#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {208#false} is VALID [2022-02-20 14:22:49,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2022-02-20 14:22:49,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {208#false} assume !(0 == ~cond); {208#false} is VALID [2022-02-20 14:22:49,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {208#false} assume true; {208#false} is VALID [2022-02-20 14:22:49,289 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {208#false} {208#false} #106#return; {208#false} is VALID [2022-02-20 14:22:49,289 INFO L272 TraceCheckUtils]: 15: Hoare triple {208#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {208#false} is VALID [2022-02-20 14:22:49,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2022-02-20 14:22:49,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {208#false} assume !(0 == ~cond); {208#false} is VALID [2022-02-20 14:22:49,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {208#false} assume true; {208#false} is VALID [2022-02-20 14:22:49,290 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {208#false} {208#false} #108#return; {208#false} is VALID [2022-02-20 14:22:49,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {208#false} assume main_~index1~0#1 > main_~index2~0#1;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {208#false} is VALID [2022-02-20 14:22:49,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {208#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {208#false} is VALID [2022-02-20 14:22:49,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {208#false} assume 0 == main_~temp~0#1; {208#false} is VALID [2022-02-20 14:22:49,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {208#false} main_~row~0#1 := 0; {208#false} is VALID [2022-02-20 14:22:49,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {208#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {208#false} is VALID [2022-02-20 14:22:49,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {208#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {208#false} is VALID [2022-02-20 14:22:49,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {208#false} assume 0 == __VERIFIER_assert_~cond#1; {208#false} is VALID [2022-02-20 14:22:49,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {208#false} assume !false; {208#false} is VALID [2022-02-20 14:22:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:22:49,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:22:49,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:49,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164483098] [2022-02-20 14:22:49,293 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:49,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556857786] [2022-02-20 14:22:49,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556857786] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:49,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:49,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 14:22:49,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075176437] [2022-02-20 14:22:49,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:49,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-02-20 14:22:49,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:49,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:49,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:49,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 14:22:49,319 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:49,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 14:22:49,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 14:22:49,320 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:49,547 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-02-20 14:22:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:22:49,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-02-20 14:22:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-02-20 14:22:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-02-20 14:22:49,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 72 transitions. [2022-02-20 14:22:49,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:49,619 INFO L225 Difference]: With dead ends: 58 [2022-02-20 14:22:49,619 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 14:22:49,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:22:49,621 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 37 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:49,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 56 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:22:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 14:22:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-02-20 14:22:49,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:49,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:49,638 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:49,638 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:49,640 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-02-20 14:22:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-02-20 14:22:49,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:49,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:49,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 39 states. [2022-02-20 14:22:49,641 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 39 states. [2022-02-20 14:22:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:49,643 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-02-20 14:22:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-02-20 14:22:49,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:49,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:49,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:49,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-02-20 14:22:49,645 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2022-02-20 14:22:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:49,645 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-02-20 14:22:49,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-02-20 14:22:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 14:22:49,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:49,647 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:49,707 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-02-20 14:22:49,863 WARN L452 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-02-20 14:22:49,864 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1984127527, now seen corresponding path program 1 times [2022-02-20 14:22:49,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:49,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261630487] [2022-02-20 14:22:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:49,884 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:49,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777961106] [2022-02-20 14:22:49,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:49,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:49,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:49,886 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-02-20 14:22:49,887 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-02-20 14:22:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:49,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:22:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:49,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:50,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {500#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {500#true} is VALID [2022-02-20 14:22:50,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {500#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {500#true} is VALID [2022-02-20 14:22:50,103 INFO L272 TraceCheckUtils]: 2: Hoare triple {500#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {500#true} is VALID [2022-02-20 14:22:50,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {500#true} ~cond := #in~cond; {500#true} is VALID [2022-02-20 14:22:50,103 INFO L290 TraceCheckUtils]: 4: Hoare triple {500#true} assume !(0 == ~cond); {500#true} is VALID [2022-02-20 14:22:50,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {500#true} assume true; {500#true} is VALID [2022-02-20 14:22:50,106 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {500#true} {500#true} #104#return; {500#true} is VALID [2022-02-20 14:22:50,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {500#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {526#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:22:50,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {526#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {530#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:22:50,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {501#false} is VALID [2022-02-20 14:22:50,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {501#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {501#false} is VALID [2022-02-20 14:22:50,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {501#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {501#false} is VALID [2022-02-20 14:22:50,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {501#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {501#false} is VALID [2022-02-20 14:22:50,110 INFO L272 TraceCheckUtils]: 13: Hoare triple {501#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {501#false} is VALID [2022-02-20 14:22:50,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {501#false} ~cond := #in~cond; {501#false} is VALID [2022-02-20 14:22:50,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {501#false} assume !(0 == ~cond); {501#false} is VALID [2022-02-20 14:22:50,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {501#false} assume true; {501#false} is VALID [2022-02-20 14:22:50,111 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {501#false} {501#false} #106#return; {501#false} is VALID [2022-02-20 14:22:50,111 INFO L272 TraceCheckUtils]: 18: Hoare triple {501#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {501#false} is VALID [2022-02-20 14:22:50,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {501#false} ~cond := #in~cond; {501#false} is VALID [2022-02-20 14:22:50,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {501#false} assume !(0 == ~cond); {501#false} is VALID [2022-02-20 14:22:50,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {501#false} assume true; {501#false} is VALID [2022-02-20 14:22:50,112 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {501#false} {501#false} #108#return; {501#false} is VALID [2022-02-20 14:22:50,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {501#false} assume main_~index1~0#1 > main_~index2~0#1;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {501#false} is VALID [2022-02-20 14:22:50,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {501#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {501#false} is VALID [2022-02-20 14:22:50,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {501#false} assume 0 == main_~temp~0#1; {501#false} is VALID [2022-02-20 14:22:50,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {501#false} main_~row~0#1 := 0; {501#false} is VALID [2022-02-20 14:22:50,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {501#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {501#false} is VALID [2022-02-20 14:22:50,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {501#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {501#false} is VALID [2022-02-20 14:22:50,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {501#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {501#false} is VALID [2022-02-20 14:22:50,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {501#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {501#false} is VALID [2022-02-20 14:22:50,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {501#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {501#false} is VALID [2022-02-20 14:22:50,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {501#false} assume 0 == __VERIFIER_assert_~cond#1; {501#false} is VALID [2022-02-20 14:22:50,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {501#false} assume !false; {501#false} is VALID [2022-02-20 14:22:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:22:50,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:22:50,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:50,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261630487] [2022-02-20 14:22:50,117 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:50,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777961106] [2022-02-20 14:22:50,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777961106] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:50,119 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:50,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:22:50,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120426657] [2022-02-20 14:22:50,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:50,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-02-20 14:22:50,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:50,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:50,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:50,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:22:50,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:50,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:22:50,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:22:50,146 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:50,273 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-02-20 14:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:22:50,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-02-20 14:22:50,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-02-20 14:22:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-02-20 14:22:50,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2022-02-20 14:22:50,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:50,358 INFO L225 Difference]: With dead ends: 61 [2022-02-20 14:22:50,358 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 14:22:50,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-02-20 14:22:50,360 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:50,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 48 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:22:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 14:22:50,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-02-20 14:22:50,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:50,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:50,383 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:50,383 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:50,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:50,386 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 14:22:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 14:22:50,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:50,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:50,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-02-20 14:22:50,390 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-02-20 14:22:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:50,393 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 14:22:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 14:22:50,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:50,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:50,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:50,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-02-20 14:22:50,396 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 34 [2022-02-20 14:22:50,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:50,396 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-02-20 14:22:50,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-02-20 14:22:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 14:22:50,397 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:50,398 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:50,417 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-02-20 14:22:50,603 WARN L452 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-02-20 14:22:50,604 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1380575367, now seen corresponding path program 1 times [2022-02-20 14:22:50,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:50,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825222215] [2022-02-20 14:22:50,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:50,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:50,624 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:50,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [680055136] [2022-02-20 14:22:50,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:50,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:50,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:50,627 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-02-20 14:22:50,628 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-02-20 14:22:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:50,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 14:22:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:50,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:51,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {811#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {811#true} is VALID [2022-02-20 14:22:51,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {811#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {811#true} is VALID [2022-02-20 14:22:51,046 INFO L272 TraceCheckUtils]: 2: Hoare triple {811#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {811#true} is VALID [2022-02-20 14:22:51,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {811#true} ~cond := #in~cond; {811#true} is VALID [2022-02-20 14:22:51,046 INFO L290 TraceCheckUtils]: 4: Hoare triple {811#true} assume !(0 == ~cond); {811#true} is VALID [2022-02-20 14:22:51,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {811#true} assume true; {811#true} is VALID [2022-02-20 14:22:51,046 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {811#true} {811#true} #104#return; {811#true} is VALID [2022-02-20 14:22:51,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {811#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {811#true} is VALID [2022-02-20 14:22:51,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {811#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {840#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:22:51,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {840#(<= |ULTIMATE.start_main_~column~0#1| 0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {840#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:22:51,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {840#(<= |ULTIMATE.start_main_~column~0#1| 0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {847#(<= |ULTIMATE.start_main_~column~0#1| 1)} is VALID [2022-02-20 14:22:51,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {847#(<= |ULTIMATE.start_main_~column~0#1| 1)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {851#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:51,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {851#(<= ~ARR_SIZE~0 1)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {851#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:51,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {851#(<= ~ARR_SIZE~0 1)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {851#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:51,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {851#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {851#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:51,056 INFO L272 TraceCheckUtils]: 15: Hoare triple {851#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {851#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:51,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {851#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {867#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-02-20 14:22:51,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {867#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {871#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:22:51,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {871#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} assume true; {871#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:22:51,058 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {871#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} {851#(<= ~ARR_SIZE~0 1)} #106#return; {878#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:22:51,059 INFO L272 TraceCheckUtils]: 20: Hoare triple {878#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {882#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1))} is VALID [2022-02-20 14:22:51,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {882#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1))} ~cond := #in~cond; {886#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-02-20 14:22:51,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {886#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {890#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:22:51,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {890#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} assume true; {890#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:22:51,064 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {890#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} {878#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} #108#return; {897#(and (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| 1) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index2~0#1| 1))} is VALID [2022-02-20 14:22:51,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {897#(and (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| 1) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index2~0#1| 1))} assume main_~index1~0#1 > main_~index2~0#1;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {812#false} is VALID [2022-02-20 14:22:51,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {812#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {812#false} is VALID [2022-02-20 14:22:51,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {812#false} assume 0 == main_~temp~0#1; {812#false} is VALID [2022-02-20 14:22:51,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {812#false} main_~row~0#1 := 0; {812#false} is VALID [2022-02-20 14:22:51,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {812#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {812#false} is VALID [2022-02-20 14:22:51,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {812#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {812#false} is VALID [2022-02-20 14:22:51,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {812#false} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {812#false} is VALID [2022-02-20 14:22:51,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {812#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {812#false} is VALID [2022-02-20 14:22:51,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {812#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {812#false} is VALID [2022-02-20 14:22:51,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {812#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {812#false} is VALID [2022-02-20 14:22:51,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {812#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {812#false} is VALID [2022-02-20 14:22:51,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {812#false} assume 0 == __VERIFIER_assert_~cond#1; {812#false} is VALID [2022-02-20 14:22:51,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {812#false} assume !false; {812#false} is VALID [2022-02-20 14:22:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:22:51,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:22:51,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {812#false} assume !false; {812#false} is VALID [2022-02-20 14:22:51,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {812#false} assume 0 == __VERIFIER_assert_~cond#1; {812#false} is VALID [2022-02-20 14:22:51,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {812#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {812#false} is VALID [2022-02-20 14:22:51,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {812#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {812#false} is VALID [2022-02-20 14:22:51,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {812#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {812#false} is VALID [2022-02-20 14:22:51,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {812#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {812#false} is VALID [2022-02-20 14:22:51,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {812#false} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {812#false} is VALID [2022-02-20 14:22:51,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {812#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {812#false} is VALID [2022-02-20 14:22:51,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {812#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {812#false} is VALID [2022-02-20 14:22:51,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {812#false} main_~row~0#1 := 0; {812#false} is VALID [2022-02-20 14:22:51,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {812#false} assume 0 == main_~temp~0#1; {812#false} is VALID [2022-02-20 14:22:51,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {812#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {812#false} is VALID [2022-02-20 14:22:51,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {973#(not (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))} assume main_~index1~0#1 > main_~index2~0#1;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {812#false} is VALID [2022-02-20 14:22:51,708 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {981#(not (= |assume_abort_if_not_#in~cond| 0))} {977#(or (<= ~ARR_SIZE~0 0) (<= |ULTIMATE.start_main_~index1~0#1| 0))} #108#return; {973#(not (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))} is VALID [2022-02-20 14:22:51,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {981#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {981#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:22:51,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {988#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {981#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:22:51,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {811#true} ~cond := #in~cond; {988#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 14:22:51,709 INFO L272 TraceCheckUtils]: 20: Hoare triple {977#(or (<= ~ARR_SIZE~0 0) (<= |ULTIMATE.start_main_~index1~0#1| 0))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {811#true} is VALID [2022-02-20 14:22:51,710 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {998#(or (not (= |assume_abort_if_not_#in~cond| 0)) (<= ~ARR_SIZE~0 0) (not (<= ~ARR_SIZE~0 1)))} {851#(<= ~ARR_SIZE~0 1)} #106#return; {977#(or (<= ~ARR_SIZE~0 0) (<= |ULTIMATE.start_main_~index1~0#1| 0))} is VALID [2022-02-20 14:22:51,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {998#(or (not (= |assume_abort_if_not_#in~cond| 0)) (<= ~ARR_SIZE~0 0) (not (<= ~ARR_SIZE~0 1)))} assume true; {998#(or (not (= |assume_abort_if_not_#in~cond| 0)) (<= ~ARR_SIZE~0 0) (not (<= ~ARR_SIZE~0 1)))} is VALID [2022-02-20 14:22:51,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {1005#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0) (<= ~ARR_SIZE~0 0) (not (<= ~ARR_SIZE~0 1)))} assume !(0 == ~cond); {998#(or (not (= |assume_abort_if_not_#in~cond| 0)) (<= ~ARR_SIZE~0 0) (not (<= ~ARR_SIZE~0 1)))} is VALID [2022-02-20 14:22:51,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {811#true} ~cond := #in~cond; {1005#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0) (<= ~ARR_SIZE~0 0) (not (<= ~ARR_SIZE~0 1)))} is VALID [2022-02-20 14:22:51,712 INFO L272 TraceCheckUtils]: 15: Hoare triple {851#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {811#true} is VALID [2022-02-20 14:22:51,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {851#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {851#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:51,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {851#(<= ~ARR_SIZE~0 1)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {851#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:51,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {851#(<= ~ARR_SIZE~0 1)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {851#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:51,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {847#(<= |ULTIMATE.start_main_~column~0#1| 1)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {851#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:51,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {840#(<= |ULTIMATE.start_main_~column~0#1| 0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {847#(<= |ULTIMATE.start_main_~column~0#1| 1)} is VALID [2022-02-20 14:22:51,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {840#(<= |ULTIMATE.start_main_~column~0#1| 0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {840#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:22:51,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {811#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {840#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:22:51,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {811#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {811#true} is VALID [2022-02-20 14:22:51,715 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {811#true} {811#true} #104#return; {811#true} is VALID [2022-02-20 14:22:51,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {811#true} assume true; {811#true} is VALID [2022-02-20 14:22:51,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {811#true} assume !(0 == ~cond); {811#true} is VALID [2022-02-20 14:22:51,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {811#true} ~cond := #in~cond; {811#true} is VALID [2022-02-20 14:22:51,715 INFO L272 TraceCheckUtils]: 2: Hoare triple {811#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {811#true} is VALID [2022-02-20 14:22:51,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {811#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {811#true} is VALID [2022-02-20 14:22:51,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {811#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {811#true} is VALID [2022-02-20 14:22:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:22:51,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:51,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825222215] [2022-02-20 14:22:51,717 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:51,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680055136] [2022-02-20 14:22:51,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680055136] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:22:51,717 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:22:51,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-02-20 14:22:51,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231625009] [2022-02-20 14:22:51,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:22:51,718 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2022-02-20 14:22:51,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:51,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:22:51,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:51,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 14:22:51,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:51,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 14:22:51,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-02-20 14:22:51,748 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 18 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:22:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:52,712 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-02-20 14:22:52,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 14:22:52,712 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2022-02-20 14:22:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:22:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 146 transitions. [2022-02-20 14:22:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:22:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 146 transitions. [2022-02-20 14:22:52,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 146 transitions. [2022-02-20 14:22:52,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:52,826 INFO L225 Difference]: With dead ends: 129 [2022-02-20 14:22:52,826 INFO L226 Difference]: Without dead ends: 108 [2022-02-20 14:22:52,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=803, Unknown=0, NotChecked=0, Total=992 [2022-02-20 14:22:52,827 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 127 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:52,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 168 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:22:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-02-20 14:22:52,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 58. [2022-02-20 14:22:52,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:52,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 58 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 48 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:22:52,874 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 58 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 48 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:22:52,875 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 58 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 48 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:22:52,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:52,878 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2022-02-20 14:22:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2022-02-20 14:22:52,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:52,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:52,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 48 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 108 states. [2022-02-20 14:22:52,879 INFO L87 Difference]: Start difference. First operand has 58 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 48 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 108 states. [2022-02-20 14:22:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:52,882 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2022-02-20 14:22:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2022-02-20 14:22:52,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:52,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:52,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:52,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 48 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:22:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-02-20 14:22:52,885 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 38 [2022-02-20 14:22:52,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:52,885 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-02-20 14:22:52,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:22:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-02-20 14:22:52,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 14:22:52,886 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:52,886 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:52,910 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-02-20 14:22:53,107 WARN L452 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-02-20 14:22:53,108 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:53,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:53,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1967381381, now seen corresponding path program 1 times [2022-02-20 14:22:53,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:53,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474245058] [2022-02-20 14:22:53,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:53,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:53,128 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:53,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1369232116] [2022-02-20 14:22:53,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:53,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:53,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:53,144 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-02-20 14:22:53,173 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-02-20 14:22:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:53,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 14:22:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:53,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:53,569 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 45 treesize of output 40 [2022-02-20 14:22:53,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-02-20 14:22:54,170 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 98 treesize of output 87 [2022-02-20 14:22:54,218 INFO L356 Elim1Store]: treesize reduction 173, result has 11.3 percent of original size [2022-02-20 14:22:54,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 144 [2022-02-20 14:22:54,708 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 40 treesize of output 28 [2022-02-20 14:22:54,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {1551#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1551#true} is VALID [2022-02-20 14:22:54,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {1551#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1551#true} is VALID [2022-02-20 14:22:54,954 INFO L272 TraceCheckUtils]: 2: Hoare triple {1551#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1551#true} is VALID [2022-02-20 14:22:54,954 INFO L290 TraceCheckUtils]: 3: Hoare triple {1551#true} ~cond := #in~cond; {1551#true} is VALID [2022-02-20 14:22:54,955 INFO L290 TraceCheckUtils]: 4: Hoare triple {1551#true} assume !(0 == ~cond); {1551#true} is VALID [2022-02-20 14:22:54,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {1551#true} assume true; {1551#true} is VALID [2022-02-20 14:22:54,955 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1551#true} {1551#true} #104#return; {1551#true} is VALID [2022-02-20 14:22:54,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {1551#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {1577#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0))} is VALID [2022-02-20 14:22:54,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {1577#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1581#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:22:54,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {1581#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1585#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:22:54,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1589#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~column~0#1| 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:54,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {1589#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~column~0#1| 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:54,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:54,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:54,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:54,960 INFO L272 TraceCheckUtils]: 15: Hoare triple {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:54,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} ~cond := #in~cond; {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:54,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} assume !(0 == ~cond); {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:54,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} assume true; {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:54,963 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} #106#return; {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:54,965 INFO L272 TraceCheckUtils]: 20: Hoare triple {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:54,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} ~cond := #in~cond; {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:54,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} assume !(0 == ~cond); {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:54,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} assume true; {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:54,967 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1606#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} #108#return; {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:54,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !(main_~index1~0#1 > main_~index2~0#1);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);main_#t~ite10#1 := main_#t~mem9#1; {1637#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_#t~ite10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:54,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {1637#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_#t~ite10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:54,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume 0 == main_~temp~0#1; {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:54,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {1593#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} main_~row~0#1 := 0; {1647#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:54,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {1647#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1651#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:54,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {1651#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {1655#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1))} is VALID [2022-02-20 14:22:54,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {1655#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1655#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1))} is VALID [2022-02-20 14:22:54,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {1655#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1655#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1))} is VALID [2022-02-20 14:22:54,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {1655#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1))} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1655#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1))} is VALID [2022-02-20 14:22:54,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {1655#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1655#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1))} is VALID [2022-02-20 14:22:54,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {1655#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1671#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:22:54,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {1671#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1552#false} is VALID [2022-02-20 14:22:54,981 INFO L290 TraceCheckUtils]: 37: Hoare triple {1552#false} assume !false; {1552#false} is VALID [2022-02-20 14:22:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:22:54,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:22:55,820 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 56 treesize of output 52 [2022-02-20 14:22:55,847 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:22:55,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 121 [2022-02-20 14:22:56,040 INFO L356 Elim1Store]: treesize reduction 150, result has 27.9 percent of original size [2022-02-20 14:22:56,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 139 treesize of output 117 [2022-02-20 14:22:56,724 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:22:56,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 146 [2022-02-20 14:23:02,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {1552#false} assume !false; {1552#false} is VALID [2022-02-20 14:23:02,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {1671#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1552#false} is VALID [2022-02-20 14:23:02,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {1684#(<= (+ (* 2 |ULTIMATE.start_main_~sum~0#1|) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1671#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:23:02,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {1684#(<= (+ (* 2 |ULTIMATE.start_main_~sum~0#1|) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1684#(<= (+ (* 2 |ULTIMATE.start_main_~sum~0#1|) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:02,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {1684#(<= (+ (* 2 |ULTIMATE.start_main_~sum~0#1|) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0))} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1684#(<= (+ (* 2 |ULTIMATE.start_main_~sum~0#1|) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:02,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {1684#(<= (+ (* 2 |ULTIMATE.start_main_~sum~0#1|) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1684#(<= (+ (* 2 |ULTIMATE.start_main_~sum~0#1|) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:02,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {1684#(<= (+ (* 2 |ULTIMATE.start_main_~sum~0#1|) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1684#(<= (+ (* 2 |ULTIMATE.start_main_~sum~0#1|) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:02,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {1700#(and (or (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))) (or (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2)) (<= (mod ~ARR_SIZE~0 4294967296) 2147483647)))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {1684#(<= (+ (* 2 |ULTIMATE.start_main_~sum~0#1|) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:02,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {1704#(and (or (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))) (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1700#(and (or (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))) (or (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2)) (<= (mod ~ARR_SIZE~0 4294967296) 2147483647)))} is VALID [2022-02-20 14:23:02,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} main_~row~0#1 := 0; {1704#(and (or (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))) (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))))} is VALID [2022-02-20 14:23:02,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} assume 0 == main_~temp~0#1; {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} is VALID [2022-02-20 14:23:02,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {1715#(and (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (<= (+ |ULTIMATE.start_main_~sum~0#1| (select (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) |ULTIMATE.start_main_#t~ite10#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))) (or (<= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) |ULTIMATE.start_main_#t~ite10#1|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2)) (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647))))} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} is VALID [2022-02-20 14:23:02,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} assume !(main_~index1~0#1 > main_~index2~0#1);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);main_#t~ite10#1 := main_#t~mem9#1; {1715#(and (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (<= (+ |ULTIMATE.start_main_~sum~0#1| (select (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) |ULTIMATE.start_main_#t~ite10#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))) (or (<= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) |ULTIMATE.start_main_#t~ite10#1|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2)) (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647))))} is VALID [2022-02-20 14:23:02,461 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1551#true} {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} #108#return; {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} is VALID [2022-02-20 14:23:02,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {1551#true} assume true; {1551#true} is VALID [2022-02-20 14:23:02,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {1551#true} assume !(0 == ~cond); {1551#true} is VALID [2022-02-20 14:23:02,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {1551#true} ~cond := #in~cond; {1551#true} is VALID [2022-02-20 14:23:02,461 INFO L272 TraceCheckUtils]: 20: Hoare triple {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1551#true} is VALID [2022-02-20 14:23:02,462 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1551#true} {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} #106#return; {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} is VALID [2022-02-20 14:23:02,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {1551#true} assume true; {1551#true} is VALID [2022-02-20 14:23:02,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {1551#true} assume !(0 == ~cond); {1551#true} is VALID [2022-02-20 14:23:02,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {1551#true} ~cond := #in~cond; {1551#true} is VALID [2022-02-20 14:23:02,462 INFO L272 TraceCheckUtils]: 15: Hoare triple {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1551#true} is VALID [2022-02-20 14:23:02,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} is VALID [2022-02-20 14:23:02,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} is VALID [2022-02-20 14:23:02,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} is VALID [2022-02-20 14:23:02,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {1761#(or (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2)))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1708#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))} is VALID [2022-02-20 14:23:02,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {1765#(or (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2)) (< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1761#(or (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2)))} is VALID [2022-02-20 14:23:02,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {1769#(or (< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0) (and (or (< 2147483647 (mod ~ARR_SIZE~0 4294967296)) (= 0 (+ (* |ULTIMATE.start_main_~column~0#1| 4) (* (* (mod ~ARR_SIZE~0 4294967296) |ULTIMATE.start_main_~row~0#1|) 4)))) (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (= (* 17179869184 |ULTIMATE.start_main_~row~0#1|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) (* (* (mod ~ARR_SIZE~0 4294967296) |ULTIMATE.start_main_~row~0#1|) 4)))) (<= |ULTIMATE.start_main_~sum~0#1| (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1765#(or (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2)) (< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:04,489 WARN L290 TraceCheckUtils]: 8: Hoare triple {1773#(forall ((~ARR_SIZE~0 Int)) (or (< 1 ~ARR_SIZE~0) (not (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)) (and (<= |ULTIMATE.start_main_~sum~0#1| (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2)) (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (= (* (* (mod ~ARR_SIZE~0 4294967296) |ULTIMATE.start_main_~row~0#1|) 4) 0))))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1769#(or (< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0) (and (or (< 2147483647 (mod ~ARR_SIZE~0 4294967296)) (= 0 (+ (* |ULTIMATE.start_main_~column~0#1| 4) (* (* (mod ~ARR_SIZE~0 4294967296) |ULTIMATE.start_main_~row~0#1|) 4)))) (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (= (* 17179869184 |ULTIMATE.start_main_~row~0#1|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) (* (* (mod ~ARR_SIZE~0 4294967296) |ULTIMATE.start_main_~row~0#1|) 4)))) (<= |ULTIMATE.start_main_~sum~0#1| (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2))))} is UNKNOWN [2022-02-20 14:23:04,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {1551#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {1773#(forall ((~ARR_SIZE~0 Int)) (or (< 1 ~ARR_SIZE~0) (not (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)) (and (<= |ULTIMATE.start_main_~sum~0#1| (div (+ (* (- 1) ~ARR_SIZE~0) (* ~ARR_SIZE~0 ~ARR_SIZE~0)) 2)) (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (= (* (* (mod ~ARR_SIZE~0 4294967296) |ULTIMATE.start_main_~row~0#1|) 4) 0))))} is VALID [2022-02-20 14:23:04,491 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1551#true} {1551#true} #104#return; {1551#true} is VALID [2022-02-20 14:23:04,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {1551#true} assume true; {1551#true} is VALID [2022-02-20 14:23:04,492 INFO L290 TraceCheckUtils]: 4: Hoare triple {1551#true} assume !(0 == ~cond); {1551#true} is VALID [2022-02-20 14:23:04,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {1551#true} ~cond := #in~cond; {1551#true} is VALID [2022-02-20 14:23:04,492 INFO L272 TraceCheckUtils]: 2: Hoare triple {1551#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1551#true} is VALID [2022-02-20 14:23:04,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {1551#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1551#true} is VALID [2022-02-20 14:23:04,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {1551#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1551#true} is VALID [2022-02-20 14:23:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:23:04,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:04,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474245058] [2022-02-20 14:23:04,492 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:04,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369232116] [2022-02-20 14:23:04,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369232116] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:04,493 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:04,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2022-02-20 14:23:04,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530515731] [2022-02-20 14:23:04,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:04,493 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-02-20 14:23:04,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:04,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:06,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:06,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 14:23:06,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:06,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 14:23:06,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=360, Unknown=1, NotChecked=0, Total=462 [2022-02-20 14:23:06,657 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:10,982 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2022-02-20 14:23:10,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-20 14:23:10,982 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-02-20 14:23:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2022-02-20 14:23:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2022-02-20 14:23:10,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 118 transitions. [2022-02-20 14:23:11,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:11,387 INFO L225 Difference]: With dead ends: 131 [2022-02-20 14:23:11,387 INFO L226 Difference]: Without dead ends: 125 [2022-02-20 14:23:11,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=422, Invalid=1469, Unknown=1, NotChecked=0, Total=1892 [2022-02-20 14:23:11,389 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 130 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:11,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 182 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 318 Invalid, 0 Unknown, 102 Unchecked, 1.1s Time] [2022-02-20 14:23:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-20 14:23:11,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 70. [2022-02-20 14:23:11,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:11,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:11,489 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:11,490 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:11,496 INFO L93 Difference]: Finished difference Result 125 states and 152 transitions. [2022-02-20 14:23:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2022-02-20 14:23:11,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:11,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:11,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 125 states. [2022-02-20 14:23:11,497 INFO L87 Difference]: Start difference. First operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 125 states. [2022-02-20 14:23:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:11,503 INFO L93 Difference]: Finished difference Result 125 states and 152 transitions. [2022-02-20 14:23:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2022-02-20 14:23:11,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:11,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:11,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:11,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2022-02-20 14:23:11,509 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 38 [2022-02-20 14:23:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:11,509 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2022-02-20 14:23:11,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:11,509 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-02-20 14:23:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 14:23:11,510 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:11,510 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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-02-20 14:23:11,530 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-02-20 14:23:11,719 WARN L452 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-02-20 14:23:11,719 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:11,720 INFO L85 PathProgramCache]: Analyzing trace with hash -707639139, now seen corresponding path program 2 times [2022-02-20 14:23:11,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:11,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153975471] [2022-02-20 14:23:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:11,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:11,740 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:11,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2027481927] [2022-02-20 14:23:11,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:23:11,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:11,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:11,743 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-02-20 14:23:11,744 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-02-20 14:23:11,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:23:11,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:11,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:23:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:11,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:12,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {2379#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2379#true} is VALID [2022-02-20 14:23:12,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {2379#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2379#true} is VALID [2022-02-20 14:23:12,031 INFO L272 TraceCheckUtils]: 2: Hoare triple {2379#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2379#true} is VALID [2022-02-20 14:23:12,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {2379#true} ~cond := #in~cond; {2379#true} is VALID [2022-02-20 14:23:12,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {2379#true} assume !(0 == ~cond); {2379#true} is VALID [2022-02-20 14:23:12,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-02-20 14:23:12,031 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2379#true} {2379#true} #104#return; {2379#true} is VALID [2022-02-20 14:23:12,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {2379#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {2379#true} is VALID [2022-02-20 14:23:12,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {2379#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2408#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:12,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {2408#(<= |ULTIMATE.start_main_~column~0#1| 0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {2408#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:12,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {2408#(<= |ULTIMATE.start_main_~column~0#1| 0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2415#(<= |ULTIMATE.start_main_~column~0#1| 1)} is VALID [2022-02-20 14:23:12,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {2415#(<= |ULTIMATE.start_main_~column~0#1| 1)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,039 INFO L272 TraceCheckUtils]: 15: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume !(0 == ~cond); {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume true; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,041 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2419#(<= ~ARR_SIZE~0 1)} {2419#(<= ~ARR_SIZE~0 1)} #106#return; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,041 INFO L272 TraceCheckUtils]: 20: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume !(0 == ~cond); {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume true; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,043 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2419#(<= ~ARR_SIZE~0 1)} {2419#(<= ~ARR_SIZE~0 1)} #108#return; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume !(main_~index1~0#1 > main_~index2~0#1);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);main_#t~ite10#1 := main_#t~mem9#1; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume 0 == main_~temp~0#1; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} main_~row~0#1 := 0; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2474#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:12,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {2474#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {2474#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:12,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {2474#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~column~0#1|))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2481#(and (<= ~ARR_SIZE~0 1) (<= 1 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:12,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {2481#(and (<= ~ARR_SIZE~0 1) (<= 1 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {2380#false} is VALID [2022-02-20 14:23:12,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {2380#false} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2380#false} is VALID [2022-02-20 14:23:12,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {2380#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2380#false} is VALID [2022-02-20 14:23:12,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {2380#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2380#false} is VALID [2022-02-20 14:23:12,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {2380#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2380#false} is VALID [2022-02-20 14:23:12,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {2380#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2380#false} is VALID [2022-02-20 14:23:12,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {2380#false} assume 0 == __VERIFIER_assert_~cond#1; {2380#false} is VALID [2022-02-20 14:23:12,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-02-20 14:23:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:23:12,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:12,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-02-20 14:23:12,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {2380#false} assume 0 == __VERIFIER_assert_~cond#1; {2380#false} is VALID [2022-02-20 14:23:12,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {2380#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2380#false} is VALID [2022-02-20 14:23:12,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {2380#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2380#false} is VALID [2022-02-20 14:23:12,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {2380#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2380#false} is VALID [2022-02-20 14:23:12,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {2380#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2380#false} is VALID [2022-02-20 14:23:12,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {2380#false} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2380#false} is VALID [2022-02-20 14:23:12,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {2527#(not (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {2380#false} is VALID [2022-02-20 14:23:12,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {2531#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~column~0#1| 1))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2527#(not (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:12,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {2531#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~column~0#1| 1))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {2531#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~column~0#1| 1))} is VALID [2022-02-20 14:23:12,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2531#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~column~0#1| 1))} is VALID [2022-02-20 14:23:12,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} main_~row~0#1 := 0; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume 0 == main_~temp~0#1; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume !(main_~index1~0#1 > main_~index2~0#1);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);main_#t~ite10#1 := main_#t~mem9#1; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,199 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2379#true} {2419#(<= ~ARR_SIZE~0 1)} #108#return; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-02-20 14:23:12,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {2379#true} assume !(0 == ~cond); {2379#true} is VALID [2022-02-20 14:23:12,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {2379#true} ~cond := #in~cond; {2379#true} is VALID [2022-02-20 14:23:12,199 INFO L272 TraceCheckUtils]: 20: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2379#true} is VALID [2022-02-20 14:23:12,200 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2379#true} {2419#(<= ~ARR_SIZE~0 1)} #106#return; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-02-20 14:23:12,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {2379#true} assume !(0 == ~cond); {2379#true} is VALID [2022-02-20 14:23:12,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {2379#true} ~cond := #in~cond; {2379#true} is VALID [2022-02-20 14:23:12,200 INFO L272 TraceCheckUtils]: 15: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2379#true} is VALID [2022-02-20 14:23:12,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {2419#(<= ~ARR_SIZE~0 1)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {2415#(<= |ULTIMATE.start_main_~column~0#1| 1)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2419#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:12,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {2408#(<= |ULTIMATE.start_main_~column~0#1| 0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2415#(<= |ULTIMATE.start_main_~column~0#1| 1)} is VALID [2022-02-20 14:23:12,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {2408#(<= |ULTIMATE.start_main_~column~0#1| 0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {2408#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:12,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {2379#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2408#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:12,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {2379#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {2379#true} is VALID [2022-02-20 14:23:12,203 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2379#true} {2379#true} #104#return; {2379#true} is VALID [2022-02-20 14:23:12,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-02-20 14:23:12,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {2379#true} assume !(0 == ~cond); {2379#true} is VALID [2022-02-20 14:23:12,203 INFO L290 TraceCheckUtils]: 3: Hoare triple {2379#true} ~cond := #in~cond; {2379#true} is VALID [2022-02-20 14:23:12,203 INFO L272 TraceCheckUtils]: 2: Hoare triple {2379#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2379#true} is VALID [2022-02-20 14:23:12,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {2379#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2379#true} is VALID [2022-02-20 14:23:12,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {2379#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2379#true} is VALID [2022-02-20 14:23:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:23:12,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:12,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153975471] [2022-02-20 14:23:12,204 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:12,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027481927] [2022-02-20 14:23:12,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027481927] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:12,204 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:12,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:23:12,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917599482] [2022-02-20 14:23:12,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:12,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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 40 [2022-02-20 14:23:12,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:12,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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-02-20 14:23:12,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:12,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:23:12,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:12,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:23:12,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:23:12,240 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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-02-20 14:23:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:12,883 INFO L93 Difference]: Finished difference Result 146 states and 176 transitions. [2022-02-20 14:23:12,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 14:23:12,884 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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 40 [2022-02-20 14:23:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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-02-20 14:23:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2022-02-20 14:23:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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-02-20 14:23:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2022-02-20 14:23:12,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 122 transitions. [2022-02-20 14:23:12,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:12,990 INFO L225 Difference]: With dead ends: 146 [2022-02-20 14:23:12,990 INFO L226 Difference]: Without dead ends: 109 [2022-02-20 14:23:12,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:23:12,991 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 117 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:12,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 119 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:23:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-20 14:23:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 83. [2022-02-20 14:23:13,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:13,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 83 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:13,170 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 83 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:13,170 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 83 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:13,173 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2022-02-20 14:23:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2022-02-20 14:23:13,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:13,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:13,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 109 states. [2022-02-20 14:23:13,174 INFO L87 Difference]: Start difference. First operand has 83 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 109 states. [2022-02-20 14:23:13,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:13,176 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2022-02-20 14:23:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2022-02-20 14:23:13,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:13,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:13,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:13,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2022-02-20 14:23:13,179 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 40 [2022-02-20 14:23:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:13,181 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2022-02-20 14:23:13,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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-02-20 14:23:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2022-02-20 14:23:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 14:23:13,182 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:13,182 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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-02-20 14:23:13,200 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-02-20 14:23:13,397 WARN L452 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-02-20 14:23:13,398 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:13,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash -291961609, now seen corresponding path program 2 times [2022-02-20 14:23:13,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:13,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132387153] [2022-02-20 14:23:13,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:13,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:13,414 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:13,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690694665] [2022-02-20 14:23:13,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:23:13,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:13,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:13,416 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-02-20 14:23:13,417 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-02-20 14:23:13,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:23:13,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:13,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:23:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:13,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:13,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {3169#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {3169#true} is VALID [2022-02-20 14:23:13,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {3169#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3169#true} is VALID [2022-02-20 14:23:13,652 INFO L272 TraceCheckUtils]: 2: Hoare triple {3169#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {3169#true} is VALID [2022-02-20 14:23:13,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {3169#true} ~cond := #in~cond; {3169#true} is VALID [2022-02-20 14:23:13,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {3169#true} assume !(0 == ~cond); {3169#true} is VALID [2022-02-20 14:23:13,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {3169#true} assume true; {3169#true} is VALID [2022-02-20 14:23:13,652 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3169#true} {3169#true} #104#return; {3169#true} is VALID [2022-02-20 14:23:13,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {3169#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {3195#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:23:13,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {3195#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {3199#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:13,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {3199#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {3199#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:13,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {3199#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3206#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:13,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {3206#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {3210#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:13,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {3210#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3210#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:13,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {3210#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {3210#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:13,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {3210#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3220#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:13,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {3220#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {3170#false} is VALID [2022-02-20 14:23:13,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {3170#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {3170#false} is VALID [2022-02-20 14:23:13,657 INFO L272 TraceCheckUtils]: 17: Hoare triple {3170#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {3170#false} is VALID [2022-02-20 14:23:13,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {3170#false} ~cond := #in~cond; {3170#false} is VALID [2022-02-20 14:23:13,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {3170#false} assume !(0 == ~cond); {3170#false} is VALID [2022-02-20 14:23:13,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {3170#false} assume true; {3170#false} is VALID [2022-02-20 14:23:13,658 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3170#false} {3170#false} #106#return; {3170#false} is VALID [2022-02-20 14:23:13,658 INFO L272 TraceCheckUtils]: 22: Hoare triple {3170#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {3170#false} is VALID [2022-02-20 14:23:13,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {3170#false} ~cond := #in~cond; {3170#false} is VALID [2022-02-20 14:23:13,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {3170#false} assume !(0 == ~cond); {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {3170#false} assume true; {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3170#false} {3170#false} #108#return; {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {3170#false} assume main_~index1~0#1 > main_~index2~0#1;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {3170#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {3170#false} assume 0 == main_~temp~0#1; {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {3170#false} main_~row~0#1 := 0; {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {3170#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {3170#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {3170#false} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {3170#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {3170#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {3170#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {3170#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {3170#false} assume 0 == __VERIFIER_assert_~cond#1; {3170#false} is VALID [2022-02-20 14:23:13,659 INFO L290 TraceCheckUtils]: 39: Hoare triple {3170#false} assume !false; {3170#false} is VALID [2022-02-20 14:23:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:23:13,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:13,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {3170#false} assume !false; {3170#false} is VALID [2022-02-20 14:23:13,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {3170#false} assume 0 == __VERIFIER_assert_~cond#1; {3170#false} is VALID [2022-02-20 14:23:13,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {3170#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3170#false} is VALID [2022-02-20 14:23:13,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {3170#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {3170#false} is VALID [2022-02-20 14:23:13,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {3170#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3170#false} is VALID [2022-02-20 14:23:13,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {3170#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {3170#false} is VALID [2022-02-20 14:23:13,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {3170#false} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3170#false} is VALID [2022-02-20 14:23:13,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {3170#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {3170#false} is VALID [2022-02-20 14:23:13,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {3170#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {3170#false} is VALID [2022-02-20 14:23:13,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {3170#false} main_~row~0#1 := 0; {3170#false} is VALID [2022-02-20 14:23:13,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {3170#false} assume 0 == main_~temp~0#1; {3170#false} is VALID [2022-02-20 14:23:13,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {3170#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {3170#false} is VALID [2022-02-20 14:23:13,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {3170#false} assume main_~index1~0#1 > main_~index2~0#1;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {3170#false} is VALID [2022-02-20 14:23:13,812 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3169#true} {3170#false} #108#return; {3170#false} is VALID [2022-02-20 14:23:13,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {3169#true} assume true; {3169#true} is VALID [2022-02-20 14:23:13,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {3169#true} assume !(0 == ~cond); {3169#true} is VALID [2022-02-20 14:23:13,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {3169#true} ~cond := #in~cond; {3169#true} is VALID [2022-02-20 14:23:13,812 INFO L272 TraceCheckUtils]: 22: Hoare triple {3170#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {3169#true} is VALID [2022-02-20 14:23:13,812 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3169#true} {3170#false} #106#return; {3170#false} is VALID [2022-02-20 14:23:13,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {3169#true} assume true; {3169#true} is VALID [2022-02-20 14:23:13,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {3169#true} assume !(0 == ~cond); {3169#true} is VALID [2022-02-20 14:23:13,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {3169#true} ~cond := #in~cond; {3169#true} is VALID [2022-02-20 14:23:13,813 INFO L272 TraceCheckUtils]: 17: Hoare triple {3170#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {3169#true} is VALID [2022-02-20 14:23:13,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {3170#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {3170#false} is VALID [2022-02-20 14:23:13,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {3368#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {3170#false} is VALID [2022-02-20 14:23:13,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {3372#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3368#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:13,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {3372#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {3372#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:13,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {3372#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3372#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:13,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {3382#(<= (+ |ULTIMATE.start_main_~row~0#1| 1) |ULTIMATE.start_main_~column~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {3372#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:13,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {3386#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3382#(<= (+ |ULTIMATE.start_main_~row~0#1| 1) |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:23:13,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {3386#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {3386#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:23:13,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {3195#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {3386#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:23:13,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {3169#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {3195#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:23:13,824 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3169#true} {3169#true} #104#return; {3169#true} is VALID [2022-02-20 14:23:13,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {3169#true} assume true; {3169#true} is VALID [2022-02-20 14:23:13,824 INFO L290 TraceCheckUtils]: 4: Hoare triple {3169#true} assume !(0 == ~cond); {3169#true} is VALID [2022-02-20 14:23:13,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {3169#true} ~cond := #in~cond; {3169#true} is VALID [2022-02-20 14:23:13,824 INFO L272 TraceCheckUtils]: 2: Hoare triple {3169#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {3169#true} is VALID [2022-02-20 14:23:13,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {3169#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3169#true} is VALID [2022-02-20 14:23:13,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {3169#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {3169#true} is VALID [2022-02-20 14:23:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 14:23:13,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:13,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132387153] [2022-02-20 14:23:13,825 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:13,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690694665] [2022-02-20 14:23:13,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690694665] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:13,825 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:13,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-02-20 14:23:13,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942259848] [2022-02-20 14:23:13,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:13,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 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 40 [2022-02-20 14:23:13,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:13,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 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-02-20 14:23:13,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:13,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:23:13,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:13,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:23:13,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:23:13,864 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 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-02-20 14:23:14,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:14,614 INFO L93 Difference]: Finished difference Result 154 states and 192 transitions. [2022-02-20 14:23:14,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:23:14,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 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 40 [2022-02-20 14:23:14,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 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-02-20 14:23:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 89 transitions. [2022-02-20 14:23:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 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-02-20 14:23:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 89 transitions. [2022-02-20 14:23:14,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 89 transitions. [2022-02-20 14:23:14,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:14,707 INFO L225 Difference]: With dead ends: 154 [2022-02-20 14:23:14,713 INFO L226 Difference]: Without dead ends: 113 [2022-02-20 14:23:14,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-02-20 14:23:14,714 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:14,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 118 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:23:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-02-20 14:23:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2022-02-20 14:23:14,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:14,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 97 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 85 states have internal predecessors, (102), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:14,980 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 97 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 85 states have internal predecessors, (102), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:14,980 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 97 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 85 states have internal predecessors, (102), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:14,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:14,982 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2022-02-20 14:23:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2022-02-20 14:23:14,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:14,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:14,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 85 states have internal predecessors, (102), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 113 states. [2022-02-20 14:23:14,984 INFO L87 Difference]: Start difference. First operand has 97 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 85 states have internal predecessors, (102), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 113 states. [2022-02-20 14:23:14,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:14,986 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2022-02-20 14:23:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2022-02-20 14:23:14,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:14,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:14,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:14,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:14,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 85 states have internal predecessors, (102), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2022-02-20 14:23:14,989 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 40 [2022-02-20 14:23:14,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:14,989 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2022-02-20 14:23:14,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 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-02-20 14:23:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2022-02-20 14:23:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 14:23:14,990 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:14,990 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:15,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 14:23:15,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:15,207 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:15,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:15,208 INFO L85 PathProgramCache]: Analyzing trace with hash -967924134, now seen corresponding path program 3 times [2022-02-20 14:23:15,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:15,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028826448] [2022-02-20 14:23:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:15,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:15,232 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:15,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120787562] [2022-02-20 14:23:15,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:23:15,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:15,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:15,234 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:23:15,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 14:23:15,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-20 14:23:15,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:15,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:23:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:15,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:15,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {4014#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {4014#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L272 TraceCheckUtils]: 2: Hoare triple {4014#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L290 TraceCheckUtils]: 3: Hoare triple {4014#true} ~cond := #in~cond; {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L290 TraceCheckUtils]: 4: Hoare triple {4014#true} assume !(0 == ~cond); {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {4014#true} assume true; {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4014#true} {4014#true} #104#return; {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {4014#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {4014#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {4014#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {4014#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {4014#true} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {4014#true} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {4014#true} assume !(main_~row~0#1 < ~ARR_SIZE~0); {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {4014#true} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4014#true} is VALID [2022-02-20 14:23:15,488 INFO L272 TraceCheckUtils]: 15: Hoare triple {4014#true} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {4014#true} is VALID [2022-02-20 14:23:15,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {4014#true} ~cond := #in~cond; {4014#true} is VALID [2022-02-20 14:23:15,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {4014#true} assume !(0 == ~cond); {4014#true} is VALID [2022-02-20 14:23:15,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {4014#true} assume true; {4014#true} is VALID [2022-02-20 14:23:15,489 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4014#true} {4014#true} #106#return; {4014#true} is VALID [2022-02-20 14:23:15,489 INFO L272 TraceCheckUtils]: 20: Hoare triple {4014#true} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {4014#true} is VALID [2022-02-20 14:23:15,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {4014#true} ~cond := #in~cond; {4014#true} is VALID [2022-02-20 14:23:15,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {4014#true} assume !(0 == ~cond); {4014#true} is VALID [2022-02-20 14:23:15,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {4014#true} assume true; {4014#true} is VALID [2022-02-20 14:23:15,489 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4014#true} {4014#true} #108#return; {4014#true} is VALID [2022-02-20 14:23:15,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {4014#true} assume !(main_~index1~0#1 > main_~index2~0#1);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);main_#t~ite10#1 := main_#t~mem9#1; {4014#true} is VALID [2022-02-20 14:23:15,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {4014#true} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {4014#true} is VALID [2022-02-20 14:23:15,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {4014#true} assume 0 == main_~temp~0#1; {4014#true} is VALID [2022-02-20 14:23:15,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {4014#true} main_~row~0#1 := 0; {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:15,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:15,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:15,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:15,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:15,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4119#(<= 1 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:15,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {4119#(<= 1 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4123#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:23:15,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {4123#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {4123#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:23:15,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {4123#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4130#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 1))} is VALID [2022-02-20 14:23:15,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {4130#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 1))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4015#false} is VALID [2022-02-20 14:23:15,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {4015#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4015#false} is VALID [2022-02-20 14:23:15,495 INFO L290 TraceCheckUtils]: 39: Hoare triple {4015#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {4015#false} is VALID [2022-02-20 14:23:15,495 INFO L290 TraceCheckUtils]: 40: Hoare triple {4015#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4015#false} is VALID [2022-02-20 14:23:15,495 INFO L290 TraceCheckUtils]: 41: Hoare triple {4015#false} assume 0 == __VERIFIER_assert_~cond#1; {4015#false} is VALID [2022-02-20 14:23:15,495 INFO L290 TraceCheckUtils]: 42: Hoare triple {4015#false} assume !false; {4015#false} is VALID [2022-02-20 14:23:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 14:23:15,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:15,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {4015#false} assume !false; {4015#false} is VALID [2022-02-20 14:23:15,625 INFO L290 TraceCheckUtils]: 41: Hoare triple {4015#false} assume 0 == __VERIFIER_assert_~cond#1; {4015#false} is VALID [2022-02-20 14:23:15,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {4015#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4015#false} is VALID [2022-02-20 14:23:15,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {4015#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {4015#false} is VALID [2022-02-20 14:23:15,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {4015#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4015#false} is VALID [2022-02-20 14:23:15,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {4164#(< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4015#false} is VALID [2022-02-20 14:23:15,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {4168#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4164#(< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:15,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {4168#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {4168#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:15,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {4119#(<= 1 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4168#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:15,629 INFO L290 TraceCheckUtils]: 33: Hoare triple {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4119#(<= 1 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:15,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:15,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:15,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:15,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:15,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {4014#true} main_~row~0#1 := 0; {4103#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:15,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {4014#true} assume 0 == main_~temp~0#1; {4014#true} is VALID [2022-02-20 14:23:15,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {4014#true} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {4014#true} is VALID [2022-02-20 14:23:15,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {4014#true} assume !(main_~index1~0#1 > main_~index2~0#1);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);main_#t~ite10#1 := main_#t~mem9#1; {4014#true} is VALID [2022-02-20 14:23:15,631 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4014#true} {4014#true} #108#return; {4014#true} is VALID [2022-02-20 14:23:15,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {4014#true} assume true; {4014#true} is VALID [2022-02-20 14:23:15,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {4014#true} assume !(0 == ~cond); {4014#true} is VALID [2022-02-20 14:23:15,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {4014#true} ~cond := #in~cond; {4014#true} is VALID [2022-02-20 14:23:15,632 INFO L272 TraceCheckUtils]: 20: Hoare triple {4014#true} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {4014#true} is VALID [2022-02-20 14:23:15,632 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4014#true} {4014#true} #106#return; {4014#true} is VALID [2022-02-20 14:23:15,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {4014#true} assume true; {4014#true} is VALID [2022-02-20 14:23:15,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {4014#true} assume !(0 == ~cond); {4014#true} is VALID [2022-02-20 14:23:15,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {4014#true} ~cond := #in~cond; {4014#true} is VALID [2022-02-20 14:23:15,632 INFO L272 TraceCheckUtils]: 15: Hoare triple {4014#true} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {4014#true} is VALID [2022-02-20 14:23:15,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {4014#true} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4014#true} is VALID [2022-02-20 14:23:15,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {4014#true} assume !(main_~row~0#1 < ~ARR_SIZE~0); {4014#true} is VALID [2022-02-20 14:23:15,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {4014#true} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4014#true} is VALID [2022-02-20 14:23:15,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {4014#true} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4014#true} is VALID [2022-02-20 14:23:15,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {4014#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4014#true} is VALID [2022-02-20 14:23:15,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {4014#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4014#true} is VALID [2022-02-20 14:23:15,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {4014#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4014#true} is VALID [2022-02-20 14:23:15,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {4014#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {4014#true} is VALID [2022-02-20 14:23:15,633 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4014#true} {4014#true} #104#return; {4014#true} is VALID [2022-02-20 14:23:15,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {4014#true} assume true; {4014#true} is VALID [2022-02-20 14:23:15,633 INFO L290 TraceCheckUtils]: 4: Hoare triple {4014#true} assume !(0 == ~cond); {4014#true} is VALID [2022-02-20 14:23:15,633 INFO L290 TraceCheckUtils]: 3: Hoare triple {4014#true} ~cond := #in~cond; {4014#true} is VALID [2022-02-20 14:23:15,633 INFO L272 TraceCheckUtils]: 2: Hoare triple {4014#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {4014#true} is VALID [2022-02-20 14:23:15,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {4014#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {4014#true} is VALID [2022-02-20 14:23:15,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {4014#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {4014#true} is VALID [2022-02-20 14:23:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 14:23:15,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:15,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028826448] [2022-02-20 14:23:15,634 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:15,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120787562] [2022-02-20 14:23:15,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120787562] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:15,634 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:15,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 14:23:15,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169791571] [2022-02-20 14:23:15,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:15,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-02-20 14:23:15,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:15,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:23:15,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:15,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 14:23:15,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:15,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 14:23:15,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:23:15,671 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:23:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:16,227 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2022-02-20 14:23:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:23:16,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-02-20 14:23:16,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:23:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-02-20 14:23:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:23:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-02-20 14:23:16,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-02-20 14:23:16,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:16,318 INFO L225 Difference]: With dead ends: 136 [2022-02-20 14:23:16,318 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 14:23:16,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:23:16,319 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:16,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 84 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:23:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 14:23:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2022-02-20 14:23:16,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:16,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 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-02-20 14:23:16,482 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 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-02-20 14:23:16,482 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 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-02-20 14:23:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:16,484 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-02-20 14:23:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-02-20 14:23:16,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:16,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:16,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 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 68 states. [2022-02-20 14:23:16,484 INFO L87 Difference]: Start difference. First operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 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 68 states. [2022-02-20 14:23:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:16,486 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-02-20 14:23:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-02-20 14:23:16,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:16,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:16,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:16,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 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-02-20 14:23:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-02-20 14:23:16,501 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 43 [2022-02-20 14:23:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:16,501 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-02-20 14:23:16,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:23:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-02-20 14:23:16,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 14:23:16,502 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:16,502 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2022-02-20 14:23:16,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 14:23:16,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:16,703 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:16,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:16,703 INFO L85 PathProgramCache]: Analyzing trace with hash 441313725, now seen corresponding path program 3 times [2022-02-20 14:23:16,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:16,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689385881] [2022-02-20 14:23:16,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:16,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:16,730 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:16,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [329355082] [2022-02-20 14:23:16,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:23:16,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:16,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:16,747 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:23:16,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 14:23:16,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:23:16,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:16,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 14:23:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:16,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:17,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {4713#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {4713#true} is VALID [2022-02-20 14:23:17,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {4713#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {4713#true} is VALID [2022-02-20 14:23:17,119 INFO L272 TraceCheckUtils]: 2: Hoare triple {4713#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {4713#true} is VALID [2022-02-20 14:23:17,119 INFO L290 TraceCheckUtils]: 3: Hoare triple {4713#true} ~cond := #in~cond; {4713#true} is VALID [2022-02-20 14:23:17,119 INFO L290 TraceCheckUtils]: 4: Hoare triple {4713#true} assume !(0 == ~cond); {4713#true} is VALID [2022-02-20 14:23:17,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-02-20 14:23:17,119 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4713#true} {4713#true} #104#return; {4713#true} is VALID [2022-02-20 14:23:17,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {4713#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {4713#true} is VALID [2022-02-20 14:23:17,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {4713#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4713#true} is VALID [2022-02-20 14:23:17,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {4713#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4713#true} is VALID [2022-02-20 14:23:17,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {4713#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4713#true} is VALID [2022-02-20 14:23:17,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {4713#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4713#true} is VALID [2022-02-20 14:23:17,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {4713#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4713#true} is VALID [2022-02-20 14:23:17,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {4713#true} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4713#true} is VALID [2022-02-20 14:23:17,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {4713#true} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4713#true} is VALID [2022-02-20 14:23:17,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {4713#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4713#true} is VALID [2022-02-20 14:23:17,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {4713#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4713#true} is VALID [2022-02-20 14:23:17,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {4713#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4713#true} is VALID [2022-02-20 14:23:17,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {4713#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4713#true} is VALID [2022-02-20 14:23:17,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {4713#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4713#true} is VALID [2022-02-20 14:23:17,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {4713#true} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4713#true} is VALID [2022-02-20 14:23:17,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {4713#true} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4713#true} is VALID [2022-02-20 14:23:17,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {4713#true} assume !(main_~row~0#1 < ~ARR_SIZE~0); {4713#true} is VALID [2022-02-20 14:23:17,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {4713#true} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4713#true} is VALID [2022-02-20 14:23:17,120 INFO L272 TraceCheckUtils]: 24: Hoare triple {4713#true} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {4713#true} is VALID [2022-02-20 14:23:17,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {4713#true} ~cond := #in~cond; {4793#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 14:23:17,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {4793#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:17,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {4797#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:17,123 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4797#(not (= |assume_abort_if_not_#in~cond| 0))} {4713#true} #106#return; {4804#(and (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:17,125 INFO L272 TraceCheckUtils]: 29: Hoare triple {4804#(and (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {4808#(< 0 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:17,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {4808#(< 0 ~ARR_SIZE~0)} ~cond := #in~cond; {4812#(and (< 0 ~ARR_SIZE~0) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-02-20 14:23:17,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {4812#(and (< 0 ~ARR_SIZE~0) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {4816#(and (< 0 ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:23:17,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {4816#(and (< 0 ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| 0)))} assume true; {4816#(and (< 0 ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:23:17,126 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4816#(and (< 0 ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| 0)))} {4804#(and (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} #108#return; {4823#(and (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:17,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {4823#(and (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} assume main_~index1~0#1 > main_~index2~0#1;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {4827#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:17,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {4827#(< 1 ~ARR_SIZE~0)} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {4827#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:17,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {4827#(< 1 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {4827#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:17,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {4827#(< 1 ~ARR_SIZE~0)} main_~row~0#1 := 0; {4837#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:17,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {4837#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4837#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:17,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {4837#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {4837#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:17,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {4837#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4837#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:17,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {4837#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4837#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:17,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {4837#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4853#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:17,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {4853#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {4714#false} is VALID [2022-02-20 14:23:17,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {4714#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4714#false} is VALID [2022-02-20 14:23:17,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {4714#false} assume 0 == __VERIFIER_assert_~cond#1; {4714#false} is VALID [2022-02-20 14:23:17,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {4714#false} assume !false; {4714#false} is VALID [2022-02-20 14:23:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 14:23:17,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:17,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {4714#false} assume !false; {4714#false} is VALID [2022-02-20 14:23:17,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {4714#false} assume 0 == __VERIFIER_assert_~cond#1; {4714#false} is VALID [2022-02-20 14:23:17,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {4714#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4714#false} is VALID [2022-02-20 14:23:17,806 INFO L290 TraceCheckUtils]: 43: Hoare triple {4875#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {4714#false} is VALID [2022-02-20 14:23:17,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {4879#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4875#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:17,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {4879#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4879#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:17,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {4879#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4879#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:17,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {4879#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:17,809 INFO L290 TraceCheckUtils]: 38: Hoare triple {4879#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4879#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:17,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {4827#(< 1 ~ARR_SIZE~0)} main_~row~0#1 := 0; {4879#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:17,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {4827#(< 1 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {4827#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:17,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {4827#(< 1 ~ARR_SIZE~0)} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {4827#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:17,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {4904#(or (< 1 ~ARR_SIZE~0) (not (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|)))} assume main_~index1~0#1 > main_~index2~0#1;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {4827#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:17,811 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4912#(or (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0))} {4908#(or (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 0) (<= |ULTIMATE.start_main_~index1~0#1| 0))} #108#return; {4904#(or (< 1 ~ARR_SIZE~0) (not (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|)))} is VALID [2022-02-20 14:23:17,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {4912#(or (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0))} assume true; {4912#(or (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:17,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {4919#(or (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4912#(or (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:17,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {4713#true} ~cond := #in~cond; {4919#(or (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 14:23:17,812 INFO L272 TraceCheckUtils]: 29: Hoare triple {4908#(or (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 0) (<= |ULTIMATE.start_main_~index1~0#1| 0))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {4713#true} is VALID [2022-02-20 14:23:17,813 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4797#(not (= |assume_abort_if_not_#in~cond| 0))} {4713#true} #106#return; {4908#(or (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 0) (<= |ULTIMATE.start_main_~index1~0#1| 0))} is VALID [2022-02-20 14:23:17,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {4797#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:17,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {4935#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:17,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {4713#true} ~cond := #in~cond; {4935#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 14:23:17,814 INFO L272 TraceCheckUtils]: 24: Hoare triple {4713#true} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {4713#true} is VALID [2022-02-20 14:23:17,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {4713#true} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4713#true} is VALID [2022-02-20 14:23:17,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {4713#true} assume !(main_~row~0#1 < ~ARR_SIZE~0); {4713#true} is VALID [2022-02-20 14:23:17,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {4713#true} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4713#true} is VALID [2022-02-20 14:23:17,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {4713#true} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4713#true} is VALID [2022-02-20 14:23:17,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {4713#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4713#true} is VALID [2022-02-20 14:23:17,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {4713#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4713#true} is VALID [2022-02-20 14:23:17,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {4713#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4713#true} is VALID [2022-02-20 14:23:17,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {4713#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4713#true} is VALID [2022-02-20 14:23:17,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {4713#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4713#true} is VALID [2022-02-20 14:23:17,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {4713#true} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4713#true} is VALID [2022-02-20 14:23:17,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {4713#true} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4713#true} is VALID [2022-02-20 14:23:17,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {4713#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4713#true} is VALID [2022-02-20 14:23:17,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {4713#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4713#true} is VALID [2022-02-20 14:23:17,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {4713#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4713#true} is VALID [2022-02-20 14:23:17,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {4713#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4713#true} is VALID [2022-02-20 14:23:17,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {4713#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4713#true} is VALID [2022-02-20 14:23:17,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {4713#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {4713#true} is VALID [2022-02-20 14:23:17,816 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4713#true} {4713#true} #104#return; {4713#true} is VALID [2022-02-20 14:23:17,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-02-20 14:23:17,816 INFO L290 TraceCheckUtils]: 4: Hoare triple {4713#true} assume !(0 == ~cond); {4713#true} is VALID [2022-02-20 14:23:17,816 INFO L290 TraceCheckUtils]: 3: Hoare triple {4713#true} ~cond := #in~cond; {4713#true} is VALID [2022-02-20 14:23:17,816 INFO L272 TraceCheckUtils]: 2: Hoare triple {4713#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {4713#true} is VALID [2022-02-20 14:23:17,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {4713#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {4713#true} is VALID [2022-02-20 14:23:17,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {4713#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {4713#true} is VALID [2022-02-20 14:23:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-02-20 14:23:17,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:17,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689385881] [2022-02-20 14:23:17,817 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:17,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329355082] [2022-02-20 14:23:17,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329355082] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:17,817 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:17,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2022-02-20 14:23:17,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604796119] [2022-02-20 14:23:17,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:17,818 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2022-02-20 14:23:17,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:17,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:17,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:17,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 14:23:17,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:17,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 14:23:17,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:23:17,862 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:18,803 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2022-02-20 14:23:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 14:23:18,803 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2022-02-20 14:23:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-02-20 14:23:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-02-20 14:23:18,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 77 transitions. [2022-02-20 14:23:18,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:18,889 INFO L225 Difference]: With dead ends: 96 [2022-02-20 14:23:18,890 INFO L226 Difference]: Without dead ends: 90 [2022-02-20 14:23:18,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2022-02-20 14:23:18,892 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 189 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:18,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 88 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:23:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-20 14:23:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 53. [2022-02-20 14:23:19,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:19,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 53 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:19,018 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 53 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:19,018 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 53 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:19,033 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2022-02-20 14:23:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2022-02-20 14:23:19,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:19,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:19,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 90 states. [2022-02-20 14:23:19,034 INFO L87 Difference]: Start difference. First operand has 53 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 90 states. [2022-02-20 14:23:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:19,035 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2022-02-20 14:23:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2022-02-20 14:23:19,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:19,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:19,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:19,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-02-20 14:23:19,037 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 47 [2022-02-20 14:23:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:19,037 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-02-20 14:23:19,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-02-20 14:23:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 14:23:19,038 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:19,038 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2022-02-20 14:23:19,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 14:23:19,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-20 14:23:19,255 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:19,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:19,255 INFO L85 PathProgramCache]: Analyzing trace with hash -4709032, now seen corresponding path program 4 times [2022-02-20 14:23:19,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:19,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327874253] [2022-02-20 14:23:19,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:19,274 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:19,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092706461] [2022-02-20 14:23:19,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:23:19,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:19,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:19,275 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:23:19,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 14:23:19,548 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:23:19,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:19,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-20 14:23:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:19,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:19,729 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-02-20 14:23:19,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 120 [2022-02-20 14:23:19,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:19,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:19,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 16 [2022-02-20 14:23:19,944 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 80 treesize of output 73 [2022-02-20 14:23:19,958 INFO L356 Elim1Store]: treesize reduction 166, result has 9.3 percent of original size [2022-02-20 14:23:19,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 140 [2022-02-20 14:23:19,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:19,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:19,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 3 [2022-02-20 14:23:20,250 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 98 treesize of output 89 [2022-02-20 14:23:20,306 INFO L356 Elim1Store]: treesize reduction 354, result has 8.8 percent of original size [2022-02-20 14:23:20,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 159 [2022-02-20 14:23:20,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:20,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:20,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:20,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 27 [2022-02-20 14:23:20,616 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 80 treesize of output 69 [2022-02-20 14:23:20,702 INFO L356 Elim1Store]: treesize reduction 279, result has 7.9 percent of original size [2022-02-20 14:23:20,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 122 [2022-02-20 14:23:20,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:20,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 16 [2022-02-20 14:23:22,433 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 104 treesize of output 91 [2022-02-20 14:23:22,715 INFO L356 Elim1Store]: treesize reduction 522, result has 6.5 percent of original size [2022-02-20 14:23:22,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 90 treesize of output 167 [2022-02-20 14:23:22,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:22,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:22,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 7 [2022-02-20 14:23:27,195 INFO L356 Elim1Store]: treesize reduction 283, result has 1.0 percent of original size [2022-02-20 14:23:27,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 121 treesize of output 46 [2022-02-20 14:23:27,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {5423#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {5423#true} is VALID [2022-02-20 14:23:27,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {5423#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {5423#true} is VALID [2022-02-20 14:23:27,556 INFO L272 TraceCheckUtils]: 2: Hoare triple {5423#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {5423#true} is VALID [2022-02-20 14:23:27,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {5423#true} ~cond := #in~cond; {5423#true} is VALID [2022-02-20 14:23:27,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {5423#true} assume !(0 == ~cond); {5423#true} is VALID [2022-02-20 14:23:27,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {5423#true} assume true; {5423#true} is VALID [2022-02-20 14:23:27,556 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5423#true} {5423#true} #104#return; {5423#true} is VALID [2022-02-20 14:23:27,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {5423#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {5449#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0))} is VALID [2022-02-20 14:23:27,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {5449#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {5453#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:23:27,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {5453#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {5457#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0))} is VALID [2022-02-20 14:23:27,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {5457#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5461#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0))} is VALID [2022-02-20 14:23:27,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {5461#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {5465#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0))} is VALID [2022-02-20 14:23:27,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {5465#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5469#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~column~0#1| 2) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0))} is VALID [2022-02-20 14:23:27,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {5469#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~column~0#1| 2) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {5473#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {5473#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5477#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {5477#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {5481#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {5481#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {5485#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {5485#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5489#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {5489#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {5493#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {5493#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5493#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {5493#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {5493#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {5493#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5493#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {5493#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {5493#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {5493#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {5493#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,584 INFO L272 TraceCheckUtils]: 24: Hoare triple {5493#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {5512#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {5512#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} ~cond := #in~cond; {5516#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {5516#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (<= ~ARR_SIZE~0 2))} assume !(0 == ~cond); {5520#(and (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {5520#(and (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} assume true; {5520#(and (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,588 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5520#(and (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} {5493#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} #106#return; {5527#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,590 INFO L272 TraceCheckUtils]: 29: Hoare triple {5527#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {5512#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {5512#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} ~cond := #in~cond; {5516#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {5516#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (<= ~ARR_SIZE~0 2))} assume !(0 == ~cond); {5520#(and (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {5520#(and (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} assume true; {5520#(and (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,595 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5520#(and (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} {5527#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} #108#return; {5543#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {5543#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} assume main_~index1~0#1 > main_~index2~0#1;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {5547#(and (= |ULTIMATE.start_main_#t~ite10#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))} is VALID [2022-02-20 14:23:27,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {5547#(and (= |ULTIMATE.start_main_#t~ite10#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {5551#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} is VALID [2022-02-20 14:23:27,606 INFO L290 TraceCheckUtils]: 36: Hoare triple {5551#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} assume 0 == main_~temp~0#1; {5551#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} is VALID [2022-02-20 14:23:27,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {5551#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} main_~row~0#1 := 0; {5558#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} is VALID [2022-02-20 14:23:27,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {5558#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {5562#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} is VALID [2022-02-20 14:23:27,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {5562#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {5566#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} is VALID [2022-02-20 14:23:27,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {5566#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5570#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~column~0#1| 1) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} is VALID [2022-02-20 14:23:27,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {5570#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~column~0#1| 1) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {5574#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} is VALID [2022-02-20 14:23:27,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {5574#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5574#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} is VALID [2022-02-20 14:23:27,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {5574#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {5574#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} is VALID [2022-02-20 14:23:27,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {5574#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {5584#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} is VALID [2022-02-20 14:23:27,648 INFO L290 TraceCheckUtils]: 45: Hoare triple {5584#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {5588#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:27,655 INFO L290 TraceCheckUtils]: 46: Hoare triple {5588#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))) (= |ULTIMATE.start_main_~row~0#1| 1))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {5592#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:27,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {5592#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))) (= |ULTIMATE.start_main_~row~0#1| 1))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5596#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:27,660 INFO L290 TraceCheckUtils]: 48: Hoare triple {5596#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index2~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))) 1) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index2~0#1| |ULTIMATE.start_main_~index1~0#1|))) (= |ULTIMATE.start_main_~row~0#1| 1))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {5600#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {5600#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5600#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,661 INFO L290 TraceCheckUtils]: 50: Hoare triple {5600#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {5600#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,662 INFO L290 TraceCheckUtils]: 51: Hoare triple {5600#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {5600#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {5600#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {5600#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:27,663 INFO L290 TraceCheckUtils]: 53: Hoare triple {5600#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5616#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:23:27,663 INFO L290 TraceCheckUtils]: 54: Hoare triple {5616#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {5424#false} is VALID [2022-02-20 14:23:27,663 INFO L290 TraceCheckUtils]: 55: Hoare triple {5424#false} assume !false; {5424#false} is VALID [2022-02-20 14:23:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:23:27,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:38,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:38,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327874253] [2022-02-20 14:23:38,588 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:38,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092706461] [2022-02-20 14:23:38,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092706461] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:23:38,589 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:23:38,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2022-02-20 14:23:38,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007006422] [2022-02-20 14:23:38,589 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:38,590 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 29 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2022-02-20 14:23:38,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:38,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 29 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:38,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:38,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-20 14:23:38,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:38,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-20 14:23:38,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1796, Unknown=1, NotChecked=0, Total=2070 [2022-02-20 14:23:38,749 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 32 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 29 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:40,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:40,622 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2022-02-20 14:23:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-20 14:23:40,633 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 29 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2022-02-20 14:23:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 29 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 106 transitions. [2022-02-20 14:23:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 29 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 106 transitions. [2022-02-20 14:23:40,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 106 transitions. [2022-02-20 14:23:40,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:40,879 INFO L225 Difference]: With dead ends: 105 [2022-02-20 14:23:40,879 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 14:23:40,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=309, Invalid=2042, Unknown=1, NotChecked=0, Total=2352 [2022-02-20 14:23:40,880 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:40,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 257 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 221 Invalid, 0 Unknown, 230 Unchecked, 0.5s Time] [2022-02-20 14:23:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 14:23:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 88. [2022-02-20 14:23:41,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:41,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 88 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 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-02-20 14:23:41,150 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 88 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 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-02-20 14:23:41,150 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 88 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 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-02-20 14:23:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:41,151 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2022-02-20 14:23:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-02-20 14:23:41,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:41,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:41,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 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) Second operand 101 states. [2022-02-20 14:23:41,152 INFO L87 Difference]: Start difference. First operand has 88 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 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) Second operand 101 states. [2022-02-20 14:23:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:41,154 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2022-02-20 14:23:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-02-20 14:23:41,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:41,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:41,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:41,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 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-02-20 14:23:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2022-02-20 14:23:41,158 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 56 [2022-02-20 14:23:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:41,158 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2022-02-20 14:23:41,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 29 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2022-02-20 14:23:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 14:23:41,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:41,160 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2022-02-20 14:23:41,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-20 14:23:41,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 14:23:41,375 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:41,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:41,376 INFO L85 PathProgramCache]: Analyzing trace with hash 214145686, now seen corresponding path program 4 times [2022-02-20 14:23:41,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:41,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419912625] [2022-02-20 14:23:41,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:41,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:41,393 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:41,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161951946] [2022-02-20 14:23:41,393 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:23:41,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:41,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:41,394 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:23:41,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 14:23:41,731 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:23:41,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:41,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 60 conjunts are in the unsatisfiable core [2022-02-20 14:23:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:41,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:41,905 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-02-20 14:23:41,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 120 [2022-02-20 14:23:41,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:41,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:41,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 18 [2022-02-20 14:23:42,075 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 76 treesize of output 69 [2022-02-20 14:23:42,101 INFO L356 Elim1Store]: treesize reduction 138, result has 8.6 percent of original size [2022-02-20 14:23:42,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 136 [2022-02-20 14:23:42,175 INFO L356 Elim1Store]: treesize reduction 275, result has 5.2 percent of original size [2022-02-20 14:23:42,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 40 [2022-02-20 14:23:42,541 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 98 treesize of output 89 [2022-02-20 14:23:42,601 INFO L356 Elim1Store]: treesize reduction 354, result has 8.8 percent of original size [2022-02-20 14:23:42,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 159 [2022-02-20 14:23:42,842 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 80 treesize of output 69 [2022-02-20 14:23:42,914 INFO L356 Elim1Store]: treesize reduction 279, result has 7.9 percent of original size [2022-02-20 14:23:42,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 122 [2022-02-20 14:23:42,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:42,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:42,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:42,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:42,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:42,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:42,981 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 89 treesize of output 43 [2022-02-20 14:23:44,382 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 134 treesize of output 117 [2022-02-20 14:23:44,581 INFO L356 Elim1Store]: treesize reduction 686, result has 7.0 percent of original size [2022-02-20 14:23:44,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 116 treesize of output 183 [2022-02-20 14:23:44,737 INFO L356 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2022-02-20 14:23:44,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 20 [2022-02-20 14:23:46,191 INFO L356 Elim1Store]: treesize reduction 420, result has 1.6 percent of original size [2022-02-20 14:23:46,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 124 treesize of output 49 [2022-02-20 14:23:46,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {6192#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {6192#true} is VALID [2022-02-20 14:23:46,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {6192#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {6200#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:23:46,559 INFO L272 TraceCheckUtils]: 2: Hoare triple {6200#(<= ~ARR_SIZE~0 32767)} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {6200#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:23:46,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {6200#(<= ~ARR_SIZE~0 32767)} ~cond := #in~cond; {6200#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:23:46,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {6200#(<= ~ARR_SIZE~0 32767)} assume !(0 == ~cond); {6200#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:23:46,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {6200#(<= ~ARR_SIZE~0 32767)} assume true; {6200#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:23:46,560 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6200#(<= ~ARR_SIZE~0 32767)} {6200#(<= ~ARR_SIZE~0 32767)} #104#return; {6200#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:23:46,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {6200#(<= ~ARR_SIZE~0 32767)} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {6219#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:23:46,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {6219#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {6223#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:23:46,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {6223#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {6227#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:23:46,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {6227#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 32767))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6231#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:23:46,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {6231#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {6235#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:23:46,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {6235#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6239#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 1) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:23:46,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {6239#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 1) (<= ~ARR_SIZE~0 32767))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {6243#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {6243#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6247#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {6247#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {6251#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {6251#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {6255#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {6255#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6259#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {6259#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,588 INFO L272 TraceCheckUtils]: 24: Hoare triple {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} ~cond := #in~cond; {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} assume !(0 == ~cond); {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} assume true; {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,604 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} #106#return; {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,606 INFO L272 TraceCheckUtils]: 29: Hoare triple {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} ~cond := #in~cond; {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} assume !(0 == ~cond); {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} assume true; {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,612 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6282#(and (< 1 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_7|) 0))) (<= ~ARR_SIZE~0 2))} {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} #108#return; {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} assume !(main_~index1~0#1 > main_~index2~0#1);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);main_#t~ite10#1 := main_#t~mem9#1; {6313#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_#t~ite10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {6313#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_#t~ite10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,622 INFO L290 TraceCheckUtils]: 36: Hoare triple {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} assume 0 == main_~temp~0#1; {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {6263#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} main_~row~0#1 := 0; {6323#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {6323#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {6327#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {6327#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {6331#(and (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|))) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {6331#(and (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|))) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6335#(and (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4)))) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,628 INFO L290 TraceCheckUtils]: 41: Hoare triple {6335#(and (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4)))) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {6339#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)))) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {6339#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)))) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6339#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)))) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,630 INFO L290 TraceCheckUtils]: 43: Hoare triple {6339#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)))) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {6339#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)))) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {6339#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)))) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {6349#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:46,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {6349#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {6353#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:46,634 INFO L290 TraceCheckUtils]: 46: Hoare triple {6353#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {6357#(and (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:46,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {6357#(and (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6361#(and (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:46,638 INFO L290 TraceCheckUtils]: 48: Hoare triple {6361#(and (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {6365#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:46,639 INFO L290 TraceCheckUtils]: 49: Hoare triple {6365#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6365#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:46,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {6365#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {6365#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:46,639 INFO L290 TraceCheckUtils]: 51: Hoare triple {6365#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {6375#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 2) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {6375#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 2) (<= ~ARR_SIZE~0 2))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {6379#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:46,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {6379#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6383#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:23:46,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {6383#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {6193#false} is VALID [2022-02-20 14:23:46,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {6193#false} assume !false; {6193#false} is VALID [2022-02-20 14:23:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:23:46,642 INFO L328 TraceCheckSpWp]: Computing backward predicates...